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

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

Offset

1,1

Links

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

Mathematica

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

Crossrefs

Cf. A104104, A104106, A104107, A104108.

Sequence in context: A277450 A188578 A322217 * A295889 A347523 A143221

Adjacent sequences: A104102 A104103 A104104 * A104106 A104107 A104108

Keyword

easy,nonn

Author

Leroy Quet, Mar 04 2005

Extensions

Edited and extended by Ray Chandler, Apr 05 2009

Status

approved