|
| |
|
|
A117943
|
|
A self-generating sequence: Let A = (a(1), a(2), ...) be the sequence. A is characterized by the properties that (i) a(1) = 0, a(2) = 1; (ii) if the terms a(3), a(6), a(9), a(12) ... are deleted, the remaining sequence is the same as A; (iii) the deleted terms also form the sequence A.
|
|
5
| |
|
|
0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| A super-fractal? Might also be called a lizard sequence (une suite du l\'{e}zard) because it grows back from its tail.
Terms were computed by Gilles Sadowski.
First differences of Rauzy's sequence A071996. - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 10 2007
|
|
|
REFERENCES
| J.-P. Delahaye, Inventiones \`{a} suivre, Pour la Science, No. 353, 2007.
|
|
|
LINKS
| Eric Angelini, Decimation-like sequences
|
|
|
FORMULA
| a(1)=0, a(1)=1; and for n>2, a(n)=a(n/3) if Mod(n,3)=0, a(n)=a(n-Floor[n/3]) if Mod(n,3)>0. - John W. Layman (layman(AT)math.vt.edu), Feb 14 2007
|
|
|
CROSSREFS
| Cf. A126616.
Sequence in context: A109017 A110161 A134667 * A096268 A079101 A076478
Adjacent sequences: A117940 A117941 A117942 * A117944 A117945 A117946
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Eric Angelini (eric.angelini(AT)kntv.be), May 03 2006
|
|
|
EXTENSIONS
| Edited by N. J. A. Sloane (njas(AT)research.att.com) at the suggestion of Andrew Plewe, Jul 14 2007
|
| |
|
|
