cp's OEIS Frontend

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.

%I A104106 #24 Apr 09 2021 18:05:03
%S A104106 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,
%T A104106 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,
%U A104106 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
%N 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.
%H A104106 Robert Israel, <a href="/A104106/b104106.txt">Table of n, a(n) for n = 1..10000</a>
%H A104106 Christian Krause, <a href="https://github.com/ckrause/loda/blob/master/programs/oeis/104/A104106.asm">LODA program for A104106</a>
%F A104106 a(n) = A089242(n) mod 2. - _Christian Krause_, Mar 19 2021
%p A104106 a:= Vector(2^9-1):
%p A104106 a[1]:= 1;
%p A104106 for k from 1 to 8 do
%p A104106   a[2^k]:= 1-a[k];
%p A104106   a[2^k+1..2^(k+1)-1]:= a[1..2^k-1]
%p A104106 od:
%p A104106 convert(a,list); # _Robert Israel_, May 07 2018
%t A104106 f[l_]:=Join[l,1-{l[[Log[2,Length[l]+1]]]},l];Nest[f,{1},7] (* _Ray Chandler_, Apr 05 2009 *)
%Y A104106 Cf. A104104, A104105, A104107, A104108.
%Y A104106 Cf. A089242.
%K A104106 easy,nonn
%O A104106 1,1
%A A104106 _Leroy Quet_, Mar 04 2005
%E A104106 Edited and extended by _Ray Chandler_, Apr 05 2009