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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A307541 a(n) is the smallest number k such that every binary string of length >= k contains either a cube or an n-anti-power. 0
 1, 3, 9, 19, 41, 58, 86 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A k-power is k consecutive identical blocks. A 3-power is called a cube. A k-anti-power is k consecutive distinct blocks of the same length. LINKS Table of n, a(n) for n=1..7. G. Fici, A. Restivo, M. Silva, and L. Q. Zamboni, Anti-Powers in Infinite Words, arXiv:1606.02868 [cs.DM], 2016-2018. EXAMPLE For n = 3, the binary string 00101001 of length 8 contains neither a cube nor a 3-anti-power. But every binary string of length >= 9 does contain either a cube or a 3-anti-power, so a(3) = 9. CROSSREFS Sequence in context: A146441 A147341 A208972 * A268403 A241626 A160704 Adjacent sequences: A307538 A307539 A307540 * A307542 A307543 A307544 KEYWORD nonn,base,more AUTHOR Samin Riasat, Apr 13 2019 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 August 3 21:27 EDT 2024. Contains 374905 sequences. (Running on oeis4.)