|
| |
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,6
|
|
|
LINKS
|
Table of n, a(n) for n=1..20.
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
Adjacent sequences: A225367 A225368 A225369 * A225371 A225372 A225373
|
|
|
KEYWORD
|
nonn,more
|
|
|
AUTHOR
|
N. J. A. Sloane, May 07 2013
|
|
|
STATUS
|
approved
|
| |
|
|
