|
%I #14 Dec 27 2022 10:56:06
%S 0,1,0,0,1,0,0,0,1,1,0,0,1,0,0,0,0,1,1,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,
%T 0,1,1,0,0,0,0,0,0,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,0,1,
%U 1,1,1,0,1,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,1,0,0,0,1
%N a(0)=0, a(1)=1; and for n>1: if n in binary representation is contained in the concatenation of all preceding terms then a(n)=1 else a(n)=0.
%H Maxim Skorohodov, <a href="/A118605/b118605.txt">Table of n, a(n) for n = 0..10000</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%t nxt[{n_,t_,a_}]:=Module[{k=If[SequenceCount[t,IntegerDigits[ n+1,2]]> 0,1,0]},{n+1,Join[t,{k}],k}]; Join[{0},NestList[nxt,{1,{0,1},1},110][[All,3]]] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, May 02 2019 *)
%Y Cf. A007088.
%K nonn,base
%O 0,1
%A _Reinhard Zumkeller_, May 08 2006
|
