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

0, 1, 2, 0, 0, 2, 1, 0, 0, 0, 1, 1, 0, 1, 0, 2, 2, 0, 1, 0, 0, 1, 0, 1, 1, 1, 2, 1, 1, 0, 0, 2, 0, 2, 0, 0, 0, 0, 2, 2, 1, 2, 2, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 2, 1, 1, 1, 0, 2, 0, 1, 1, 2, 0, 1, 2, 0, 2, 2, 2, 1, 0, 2, 1, 2, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 2, 0, 1, 0, 1, 0, 0, 2, 1, 1, 2, 2, 1, 1, 0, 1, 1, 0, 0

Offset

1,3

Comments

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

Links

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

Crossrefs

See A093691 for more information.

Cf. A093691, A093692, A079101, A038219, A080415.

Sequence in context: A317642 A258762 A079181 * A224447 A025436 A170976

Adjacent sequences: A093690 A093691 A093692 * A093694 A093695 A093696

Keyword

nonn

Author

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

Status

approved