A104106 a(1) = 1; thereafter, if A(k) = sequence of first 2^k -1 terms, then A(k+1) = A(k),1,A(k) if a(k) = 0, and A(k+1) = A(k),0,A(k) if a(k) = 1.

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

Offset

1,1

Links

Robert Israel, Table of n, a(n) for n = 1..10000

Christian Krause, LODA program for A104106

Formula

a(n) = A089242(n) mod 2. - Christian Krause, Mar 19 2021

Maple

a:= Vector(2^9-1):
a[1]:= 1;
for k from 1 to 8 do
  a[2^k]:= 1-a[k];
  a[2^k+1..2^(k+1)-1]:= a[1..2^k-1]
od:
convert(a, list); # Robert Israel, May 07 2018

Mathematica

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

Crossrefs

Cf. A104104, A104105, A104107, A104108.

Cf. A089242.

Sequence in context: A257477 A259024 A323045 * A349167 A141260 A029883

Adjacent sequences: A104103 A104104 A104105 * A104107 A104108 A104109

Keyword

easy,nonn

Author

Leroy Quet, Mar 04 2005

Extensions

Edited and extended by Ray Chandler, Apr 05 2009

Status

approved