|
| |
|
|
A065243
|
|
Number of winning length n strings with a 10 symbol alphabet in "same game".
|
|
7
| |
|
|
1, 0, 10, 10, 190, 460, 4690, 17650, 136630, 651790, 4439890, 24056020
(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, A065242.
Sequence in context: A004286 A145595 A047817 * A105750 A052983 A072804
Adjacent sequences: A065240 A065241 A065242 * A065244 A065245 A065246
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Oct 23 2001
|
| |
|
|
