login
A225370
Let f(S) = maximal m such that the string S contains two disjoint identical (scattered) substrings of length m ("twins"); a(n) = min f(S) over all binary strings of length n.
0
0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 8
OFFSET
1,6
LINKS
Maria Axenovich, Yury Person, Svetlana Puzynina, A regularity lemma and twins in words, Journal of Combinatorial Theory, Series A, V. 120, Issue 4, 2013, p. 733-743; arXiv:1204.2180.
CROSSREFS
Sequence in context: A341168 A071824 A224921 * A114540 A183142 A121830
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, May 07 2013
STATUS
approved