OFFSET
1,2
COMMENTS
It is conjectured that a(n) = min{ B(w) | w is unbordered and length(w) = n }, where B(w) is the number of distinct unbordered factors in w.
If this conjecture were to be proved, we could use this is the definition, and put the present definition into the FORMULA field. It is known to be true for n <= 20.
[A word v is bordered if there is a nonempty word u different from v which is both a prefix and a suffix of v (see, for example, Allouche and Shallit).]
REFERENCES
J.-P. Allouche and J. Shallit, Automatic Sequences, Cambridge Univ. Press, 2003, p. 28.
Kalle Saari, Open problem presented at Workshop on Challenges in Combinatorics on Words, Fields Institute, Toronto, April 21-26, 2013.
LINKS
Kalle Saari, Table of n, a(n) for n = 1..199
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, May 03 2013, based on an email from Kalle Saari, Apr 23 2013
STATUS
approved