

A108737


Start with S = {}. For m = 0, 1, 2, 3, ... let u be the binary expansion of m. If u is not a substring of S, append the minimal number of 0's and 1's to S to remedy this. Sequence gives S.


4



0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


LINKS

Table of n, a(n) for n=1..105.


EXAMPLE

We construct S as follows, starting with S = {}.
0 is missing, so S = {0};
1 is missing, so S = {0,1};
10 is missing, so S = {0,1,0};
11 is missing, so S = {0,1,0,1,1};
100 is missing, so S = {0,1,0,1,1,0,0};
101 and 110 are visible, but 111 is missing, so S = {0,1,0,1,1,0,0,1,1,1}; etc.


CROSSREFS

Cf. A108736.
Sequence in context: A090171 A118006 A165263 * A165221 A093879 A117872
Adjacent sequences: A108734 A108735 A108736 * A108738 A108739 A108740


KEYWORD

nonn,easy


AUTHOR

N. J. A. Sloane, Jun 23 2005


EXTENSIONS

More terms from John W. Layman, Jun 24 2005


STATUS

approved



