This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A230127 Number of binary strings of length n avoiding "squares" (that is, repeated blocks of the form xx) with |x| > 1. 5
 1, 2, 4, 8, 12, 20, 26, 38, 42, 52, 56, 56, 48, 42, 32, 22, 10, 4, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Entringer et al. showed that a(n) = 0 for all n >= 19. LINKS Nathaniel Johnston, C code for computing this sequence R. C. Entringer, D. E. Jackson and J. A. Schatz, On nonrepetitive sequences, J. Combin. Theory Ser. A. 16 (1974), 159-164. EXAMPLE a(4) = 12 because there are 16 binary strings of length 4, but 4 of these strings (namely 0000, 0101, 1010, and 1111) repeat a substring of length 2. Thus a(4) = 16 - 4 = 12. a(18) = 2 because there are 2 strings of length 18 not containing any "squares" of length greater than 1: 010011000111001101 and 101100111000110010. CROSSREFS Cf. A022087, A229614, A230177. Sequence in context: A127405 A136034 A243112 * A059793 A118029 A049322 Adjacent sequences:  A230124 A230125 A230126 * A230128 A230129 A230130 KEYWORD nonn,fini,full AUTHOR Nathaniel Johnston, Oct 10 2013 STATUS approved

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

Last modified January 19 05:50 EST 2019. Contains 319304 sequences. (Running on oeis4.)