

A274543


Smallest number m such that every binary string of length >= m contains either an nth power or nth antipower.


0




OFFSET

1,2


COMMENTS

By "nth power" we mean n consecutive repetitions of a nonempty block. By "nth antipower" we mean n consecutive blocks of the same size, no two of which are equal.


LINKS

Table of n, a(n) for n=1..5.
Amanda Burcroff, (k,lambda)AntiPowers and Other Patterns in Words, arXiv:1807.07945 [math.CO], 2018.
G. Fici, A. Restivo, M. Silva, and L. Q. Zamboni, Antipowers in infinite words, arxiv preprint, 1606.02868 [cs.DM], 20162018.


EXAMPLE

For n = 3 the string of length 8 corresponding to 00101001 has no 3power, nor 3antipower. But every binary string of length 9 does.


CROSSREFS

Sequence in context: A259969 A023662 A131357 * A079997 A275260 A248436
Adjacent sequences: A274540 A274541 A274542 * A274544 A274545 A274546


KEYWORD

nonn,more


AUTHOR

Jeffrey Shallit, Jun 27 2016


STATUS

approved



