login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)