login
A093692
a(n) is chosen so as to maximize the number of different substrings in (a(1),a(2),...,a(n)) (in base 2).
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.
CROSSREFS
See A093691 for more information.
Sequence in context: A241979 A200244 A261185 * A254114 A105384 A288694
KEYWORD
nonn
AUTHOR
Alejandro V. Dau (ad1n(AT)dc.uba.ar), Apr 11 2004
STATUS
approved