A065241 Number of winning length n strings with an 8-symbol alphabet in "same game".

1, 0, 8, 8, 120, 288, 2360, 8632, 55224, 249656, 1443128, 7243552, 40366040, 213357880, 1178216264, 6395922296, 35375108728, 194951335888

Offset

0,3

Comments

Strings that can be reduced to null string by repeatedly removing an entire run of two or more consecutive symbols.

For binary strings, the formula for the number of winning strings of length n has been conjectured by Ralf Stephan and proved by Burns and Purcell (2005, 2007). For b-ary strings with b >= 3, the same problem seems to be unsolved. - Petros Hadjicostas, Aug 31 2019

Links

Table of n, a(n) for n=0..17.

Chris Burns and Benjamin Purcell, A note on Stephan's conjecture 77, preprint, 2005. [Cached copy]

Chris Burns and Benjamin Purcell, Counting the number of winning strings in the 1-dimensional same game, Fibonacci Quarterly, 45(3) (2007), 233-238.

Sascha Kurz, Polynomials in "same game", 2001. [ps file]

Sascha Kurz, Polynomials for same game, 2001. [pdf file]

Ralf Stephan, Prove or disprove: 100 conjectures from the OEIS, arXiv:math/0409509 [math.CO], 2004.

Example

11011001 is a winning string since 110{11}001 -> 11{000}1 -> {111} -> null.

Crossrefs

Cf. A035615, A035617, A065237, A065238, A065239, A065240, A065242, A065243, A309874, A323812.

Row b=8 of A323844.

Sequence in context: A119932 A270118 A270150 * A255006 A074191 A090630

Adjacent sequences: A065238 A065239 A065240 * A065242 A065243 A065244

Keyword

nonn,more

Author

Sascha Kurz, Oct 23 2001

Extensions

a(12)-a(17) from Bert Dobbelaere, Dec 26 2018

Status

approved