|
| |
|
|
A065242
|
|
Number of winning length n strings with a 9 symbol alphabet in "same game".
|
|
7
| |
|
|
1, 0, 9, 9, 153, 369, 3393, 12609, 89145, 415161, 2614689, 13684977
(list; graph; refs; listen; history; 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.
|
|
|
LINKS
| Sascha Kurz, Polynomials in "same game"
|
|
|
EXAMPLE
| 11011001 is a winning string since 110{11}001->11{000}1->{111}->null
|
|
|
CROSSREFS
| Cf. A035615, A035617, A065237, A065238, A065239, A065240, A065241, A065243.
Sequence in context: A050683 A092548 A121389 * A050720 A171738 A124116
Adjacent sequences: A065239 A065240 A065241 * A065243 A065244 A065245
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Oct 23 2001
|
| |
|
|
