|
Search: id:A101807
|
|
|
| A101807 |
|
Start with 0 and decide that each digit d of the sequence means that the next integer cannot be of length d. To build the sequence take the smallest available integer not yet in the sequence. |
|
+0
1
|
|
| 0, 1, 10, 11, 2, 12, 13, 3, 14, 4, 15, 5, 6, 16, 7, 8, 17, 9, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 100
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
The first 0 means: "next integer cannot be of length zero", thus "1" ("1" being the first available integer not yet in the sequence). Now this "1" reads: "next integer cannot be of length one", thus 10 ("10" being the first two-digit integer not yet in the sequence). The next digit to be read is the "1" digit of this "10": "next integer cannot be of length one", thus 11 ("11" being the smallest two-digit integer not yet in the sequence). The next digit to be read is the "0" digit of "10" which produces "2" ("2" is not of length zero and is the smallest available integer after "1", already in the sequence) "next 10 11 2 12 13 3 14 4 15
|
|
CROSSREFS
|
Sequence in context: A072804 A079793 A086884 this_sequence A065517 A059514 A066355
Adjacent sequences: A101804 A101805 A101806 this_sequence A101808 A101809 A101810
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)skynet.be), Jan 27 2005
|
|
|
Search completed in 0.002 seconds
|
