login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118605 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. 5

%I

%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 <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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 4 21:21 EDT 2021. Contains 346455 sequences. (Running on oeis4.)