Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156818
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A156818 Last digit d of a(n) is present in a(n+1+d); a(1)=1; a(n)<a(n+1) +0
2
1, 2, 10, 20, 102, 103, 104, 112, 113, 123, 124, 134, 135, 136, 137, 140, 204, 205, 215, 216, 226, 234, 237, 245, 250, 260, 406, 416, 417, 425, 427, 428, 429, 436, 446, 450, 470, 480, 507, 508, 568, 569, 579, 580, 590, 600, 607, 608, 618, 628, 629, 639, 649 (list; graph; listen)
OFFSET

1,2

COMMENT

If a(n) has no obligation to contain one or more digits, then a(n)=a(n-1)+1. Terms computed by Duncan Booth. The sequence arising when we drop a(n)<a(n+1) is A156819

CROSSREFS

Sequence in context: A164882 A029994 A004643 this_sequence A037422 A136735 A080881

Adjacent sequences: A156815 A156816 A156817 this_sequence A156819 A156820 A156821

KEYWORD

base,easy,nonn

AUTHOR

Eric Angelini (eric.angelini(AT)skynet.be), Feb 16 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research