|
|
A065242
|
|
Number of winning length n strings with a 9-symbol alphabet in "same game".
|
|
11
|
|
|
1, 0, 9, 9, 153, 369, 3393, 12609, 89145, 415161, 2614689, 13684977, 82237185, 457154577, 2704775985, 15524314425, 91659251961
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
EXAMPLE
|
11011001 is a winning string since 110{11}001 -> 11{000}1 -> {111} -> null.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|