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 A071426 #21 Nov 18 2024 16:39:02 %S A071426 1,1,1,2,2,0,3,3,1,1,1,0,4,3,3,3,2,2,2,4,4,0,5,5,2,2,2,3,3,0,5,0,1,1, %T A071426 1,3,3,3,5,6,4,4,1,0,5,5,6,6,2,7,7,7,8,0,1,9,2,7,2,3,3,3,9,0,5,4,4,8, %U A071426 6,6,2,7,1,1,1,0,5,5,9,3,1,8,2,8,5,0,1,1,12,2,2,7,3,3,9,4,4,0,11,3,3 %N A071426 Sprague-Grundy values for octal game .11337. %C A071426 Also, with different offsets, Sprague-Grundy values for .04 [a(n-3)], .007 [a(n-2)] (Treblecross) and .0137 [a(n-1)]. %D A071426 E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982; see Chapter 4, pp. 94, 102. %H A071426 Eric M. Schmidt, <a href="/A071426/b071426.txt">Table of n, a(n) for n = 1..10000</a> %H A071426 Sierra Brown, Spencer Daugherty, Eugene Fiorini, Barbara Maldonado, Diego Manzano-Ruiz, Sean Rainville, Riley Waechter, and Tony W. H. Wong, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL23/Wong/wong24.html">Nimber Sequences of Node-Kayles Games</a>, J. Int. Seq., Vol. 23 (2020), Article 20.3.5. %H A071426 Eugene Fiorini, Maxwell Fogler, Katherine Levandosky, Bryan Lu, Jacob Porter, and Andrew Woldar, <a href="https://arxiv.org/abs/2411.08247">On the Nature and Complexity of an Impartial Two-Player Variant of the Game Lights-Out</a>, arXiv:2411.08247 [math.CO], 2024. See p. 15. %H A071426 Achim Flammenkamp, <a href="https://wwwhomes.uni-bielefeld.de/achim/octal.html">Octal games</a> %K A071426 nonn,look %O A071426 1,4 %A A071426 _N. J. A. Sloane_ and _Sue Pope_, May 29 2002 %E A071426 Edited and extended by _Christian G. Bower_, Oct 22 2002