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.

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

Offset

0,1

Links

Maxim Skorohodov, Table of n, a(n) for n = 0..10000

Index entries for sequences related to binary expansion of n

Mathematica

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 *)

Crossrefs

Cf. A007088.

Sequence in context: A129184 A129185 A283683 * A175253 A163584 A353307

Adjacent sequences: A118602 A118603 A118604 * A118606 A118607 A118608

Keyword

nonn,base

Author

Reinhard Zumkeller, May 08 2006

Status

approved