Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #5 Nov 09 2013 14:03:56
%S 0,0,1,1,1,2,2,2,3,3,4,4,5,5,5,6,6,7,7,8
%N 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.
%H Maria Axenovich, Yury Person, Svetlana Puzynina, <a href="http://arxiv.org/abs/1204.2180">A regularity lemma and twins in words</a>, Journal of Combinatorial Theory, Series A, V. 120, Issue 4, 2013, p. 733-743; arXiv:1204.2180.
%K nonn,more
%O 1,6
%A _N. J. A. Sloane_, May 07 2013