|
Search: id:A108709
|
|
|
| A108709 |
|
Start to read the sequence digit by digit and erase the first "1" you encounter, then the "first "2", the first "3", etc., until the first "9"; go on from there and erase again the first "1", the first "2", etc., until "9" -- and so on, cyclically until the end of the (infinite) sequence. Concatenate what is left. The result is the concatenation of all integers of the sequence. |
|
+0
1
|
|
| 1, 12, 13, 24, 153, 627, 4819, 5132, 6324, 7546, 8789, 9511, 23324, 65362, 74879, 514263, 847516, 879899, 5111213, 24353627, 48695132, 63247546, 87789951, 124324653, 687487951, 1263847596, 8798995112, 13241536274, 83951326324
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Fractal-like sequence.
|
|
EXAMPLE
|
Sequence starts: 1 12 13 24 153 627 4819 5132 ... Erasing cyclically digits 1 --> 9 gives: . 1. 1. 2. 1.3 .2. 4.1. 5.3. which is the pattern of the sequence itself.
|
|
CROSSREFS
|
Sequence in context: A050840 A118068 A108710 this_sequence A138821 A022102 A041292
Adjacent sequences: A108706 A108707 A108708 this_sequence A108710 A108711 A108712
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), Jun 20 2005
|
|
|
Search completed in 0.002 seconds
|
