A104108 a(1) = 1, c(1)=1, if A(k) = sequence of first c(k) terms and if B(k) is A(k) with 0's and 1's exchanged, then A(k+1) = A(k)B(k) and c(k+1)= 2*c(k) if a(k) = 1, A(k+1) = A(k),0,B(k) and c(k+1)= 2*c(k)+1 if a(k) = 0.

1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1

Offset

1,1

Links

Table of n, a(n) for n=1..105.

Mathematica

f[l_]:=Join[l, If[l[[Floor[Log[2, Length[l]]]+1]]==1, {}, {0}], 1-l]; Nest[f, {1}, 7] (* Ray Chandler, Apr 05 2009 *)

Crossrefs

Cf. A104104, A104105, A104106, A104107.

Sequence in context: A173859 A202108 A287530 * A267056 A089024 A355688

Adjacent sequences: A104105 A104106 A104107 * A104109 A104110 A104111

Keyword

easy,nonn

Author

Leroy Quet, Mar 04 2005

Extensions

Edited and extended by Ray Chandler, Apr 05 2009

Status

approved