%I A117943
%S A117943 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,
%T A117943 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,
%U A117943 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
%N 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.
%C A117943 A super-fractal? Might also be called a lizard sequence (une suite du 
               l\'{e}zard) because it grows back from its tail.
%C A117943 Terms were computed by Gilles Sadowski.
%C A117943 First differences of Rauzy's sequence A071996. - Benoit Cloitre (benoit7848c(AT)orange.fr), 
               Mar 10 2007
%D A117943 J.-P. Delahaye, Inventiones \`{a} suivre, Pour la Science, No. 353, 2007.
%H A117943 Eric Angelini, <a href="http://www.cetteadressecomportecinquantesignes.com/
               Decimation.htm">Decimation-like sequences</a>
%F A117943 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
%Y A117943 Cf. A126616.
%Y A117943 Sequence in context: A109017 A110161 A134667 this_sequence A096268 A079101 
               A076478
%Y A117943 Adjacent sequences: A117940 A117941 A117942 this_sequence A117944 A117945 
               A117946
%K A117943 nonn,easy
%O A117943 1,1
%A A117943 Eric Angelini (eric.angelini(AT)kntv.be), May 03 2006
%E A117943 Edited by N. J. A. Sloane (njas(AT)research.att.com) at the suggestion 
               of Andrew Plewe, Jul 14 2007