cp's OEIS Frontend

A065242 Number of winning length n strings with a 9-symbol alphabet in "same game".

%I A065242 #35 Jan 05 2025 19:51:36
%S A065242 1,0,9,9,153,369,3393,12609,89145,415161,2614689,13684977,82237185,
%T A065242 457154577,2704775985,15524314425,91659251961
%N A065242 Number of winning length n strings with a 9-symbol alphabet in "same game".
%C A065242 Strings that can be reduced to null string by repeatedly removing an entire run of two or more consecutive symbols.
%C A065242 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
%H A065242 Chris Burns and Benjamin Purcell, <a href="/A035615/a035615.pdf">A note on Stephan's conjecture 77</a>, preprint, 2005. [Cached copy]
%H A065242 Chris Burns and Benjamin Purcell, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Papers1/45-3/burns.pdf">Counting the number of winning strings in the 1-dimensional same game</a>, Fibonacci Quarterly, 45(3) (2007), 233-238.
%H A065242 Sascha Kurz, <a href="http://www.mathe2.uni-bayreuth.de/sascha/oeis/paper/same_game.ps">Polynomials in "same game"</a>, 2001. [ps file]
%H A065242 Sascha Kurz, <a href="http://www.mathe2.uni-bayreuth.de/sascha/oeis/paper/same_game.pdf">Polynomials for same game</a>, 2001. [pdf file]
%H A065242 Ralf Stephan, <a href="https://arxiv.org/abs/math/0409509">Prove or disprove: 100 conjectures from the OEIS</a>, arXiv:math/0409509 [math.CO], 2004.
%e A065242 11011001 is a winning string since 110{11}001 -> 11{000}1 -> {111} -> null.
%Y A065242 Cf. A035615, A035617, A065237, A065238, A065239, A065240, A065241, A065243, A309874, A323812.
%Y A065242 Row b=9 of A323844.
%K A065242 nonn,more
%O A065242 0,3
%A A065242 _Sascha Kurz_, Oct 23 2001
%E A065242 a(12)-a(16) from _Bert Dobbelaere_, Dec 26 2018