|
Search: id:A126616
|
|
|
| A126616 |
|
A self-generating sequence: Let A = (a(1), a(2), ...) be the sequence. A is characterized by the properties that (i) a(i) = i for i = 1..9; (ii) if the terms a(10), a(20), a(30), ... are deleted, the remaining sequence is the same as A; (iii) the deleted terms also form the sequence A. |
|
+0
2
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 1, 3, 2, 1, 3, 2, 1, 3, 4, 2, 1, 3, 4, 2, 1, 3, 4, 2, 5, 1, 3, 4, 2, 5, 1, 3, 4, 2, 6, 5, 1, 3, 4, 2, 6, 5, 1, 3, 7, 4, 2, 6, 5, 1, 3, 7, 4, 2, 8, 6, 5, 1, 3, 7, 4, 2, 8, 6, 9, 5, 1, 3, 7, 4, 2, 8, 6, 9, 1, 5, 1, 3, 7, 4
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Invented by Eric Angelini. Might also be called a lizard sequence (une suite du l\'{e}zard) because it grows back from its tail.
|
|
REFERENCES
|
J.-P. Delahaye, Inventiones \`{a} suivre, Pour la Science, No. 353, 2007.
|
|
MAPLE
|
A126616 := proc(n) option remember ; if n < 10 then n ; elif n mod 10 = 0 then A126616(n/10) ; else A126616( n-floor(n/10) ) ; fi ; end: seq(A126616(n), n=1..120) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 02 2007
|
|
CROSSREFS
|
Cf. A117943.
Sequence in context: A075877 A133500 A052423 this_sequence A121042 A000030 A134777
Adjacent sequences: A126613 A126614 A126615 this_sequence A126617 A126618 A126619
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Feb 09 2007
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 02 2007
|
|
|
Search completed in 0.002 seconds
|
