This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A065237 #39 Jan 05 2025 19:51:36
%S A065237 1,0,4,4,28,64,268,844,3100,10876,39244,142432,518380,1906012,7012660,
%T A065237 25980940,96407356,359260936,1341482740,5023006444,18844637356
%N A065237 Number of winning length n strings with a 4-symbol alphabet in "same game".
%C A065237 Strings that can be reduced to null string by repeatedly removing an entire run of two or more consecutive symbols.
%C A065237 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_, Jul 05 2018
%H A065237 C. Burns and B. Purcell, <a href="/A065237/a065237_1.pdf">A note on Stephan's conjecture 77</a>, preprint, 2005.
%H A065237 C. Burns and B. 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 A065237 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 A065237 Sascha Kurz, <a href="/A065237/a065237.pdf">Polynomials in "same game"</a>, 2001. [pdf file]
%e A065237 11011001 is a winning string since 110{11}001->11{000}1->{111}->null.
%Y A065237 Cf. A035615, A035617, A065238, A065239, A065240, A065241, A065242, A065243.
%Y A065237 Row b=4 of A323844.
%K A065237 nonn,more
%O A065237 0,3
%A A065237 _Sascha Kurz_, Oct 23 2001
%E A065237 a(13)-a(20) from _Bert Dobbelaere_, Dec 26 2018