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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A332234 Least integer t such that every binary word of length t+1 contains a reversed split occurrence of an n-overlap. 5
 2, 4, 15, 46 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS An "n-overlap" is a word of the form xxx', where x is a nonempty word of length at least n, and x' is a prefix of x of length n. Thus, for example, abcdabcdab is a 2-overlap. A reversed split occurrence of a pattern p is a word of the form xyz where zx matches the pattern. For n = 0,1,2,3 words achieving the bound a(n) are as follows: n = 0: 01 n = 1: 0011 n = 2: 010001100111001 n = 3: 0010100110100011111000111010000011101010001100 LINKS Table of n, a(n) for n=0..3. D. Gabric and J. Shallit, Avoidance of split overlaps, arxiv preprint arXiv:2002.01968 [cs.DM], February 5 2020. CROSSREFS Cf. A332235. Sequence in context: A072206 A296255 A277508 * A316726 A308345 A280065 Adjacent sequences: A332231 A332232 A332233 * A332235 A332236 A332237 KEYWORD nonn,more AUTHOR Jeffrey Shallit, Feb 07 2020 STATUS approved

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.

Last modified June 4 02:25 EDT 2023. Contains 363118 sequences. (Running on oeis4.)