login
A093691
a(n) is chosen so as to maximize the number of different substrings in (a(1),a(2),...,a(n)).
2
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7, 0, 8, 0, 9, 1, 0, 0, 0, 1, 1, 3, 1, 4, 1, 5, 1, 6, 1, 7, 1, 8, 1, 9, 2, 1, 0, 1, 0, 2, 2, 4, 2, 5, 2, 6, 2, 7, 2, 8, 2, 9, 3, 2, 0, 0, 3, 3, 5, 3, 6, 3, 7, 3, 8, 3, 9, 4, 3, 0, 0, 4, 4, 6, 4, 7, 4, 8, 4, 9, 5, 4, 0, 0, 5, 5, 7, 5, 8, 5, 9, 6, 5
OFFSET
1,3
COMMENTS
A "substrings maximizer sequence" (or SMS) in base 10.
If there is more than one choice for a(n), take the smallest.
REFERENCES
A. Dau, Secuencias Maximizadoras de Subcadenas, Tesis de licenciatura Cs de la Computacion, FCEyN, Universidad de Buenos Aires (2004).
LINKS
A. Dau Secuencia Maximizador a de Subcadenas (Interactive Java generator for repetition-resistant sequences)
CROSSREFS
Examples of SMS's in base 2: A079101, A038219, A093692.
Sequence in context: A265542 A103303 A297232 * A004176 A085124 A252648
KEYWORD
nonn
AUTHOR
Alejandro V. Dau (ad1n(AT)dc.uba.ar), Apr 11 2004
STATUS
approved