A093692 a(n) is chosen so as to maximize the number of different substrings in (a(1),a(2),...,a(n)) (in base 2).

0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1

Offset

1,1

Comments

A "substrings maximizer sequence" (or SMS) in base 2.

Links

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

Crossrefs

See A093691 for more information.

Cf. A093691, A093693, A079101, A038219, A080415.

Sequence in context: A241979 A200244 A261185 * A254114 A105384 A288694

Adjacent sequences: A093689 A093690 A093691 * A093693 A093694 A093695

Keyword

nonn

Author

Alejandro V. Dau (ad1n(AT)dc.uba.ar), Apr 11 2004

Status

approved