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 A071433 #17 Jan 11 2017 18:32:05 %S A071433 1,2,0,1,2,3,1,2,3,4,0,3,4,2,1,3,2,1,0,2,1,4,5,1,4,5,1,2,0,1,2,3,1,2, %T A071433 3,4,2,3,4,2,3,4,2,1,0,2,8,4,5,3,4,5,6,2,5,1,2,3,1,2,3,4,2,3,4,2,3,4, %U A071433 2,3,0,2,3,4,5,3,4,5,6,4,5,6,2,3,1,2,3,4,2,3,4,2,3,4,2,3,0,2,3,4,5,3 %N A071433 Sprague-Grundy values for octal game .37. %C A071433 Octal games .6, .601, .61, .611, .62, .621, .63, .631 (Officers) have values a(n-1). %D A071433 E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982; see Chapter 4, pp. 96, 102. %D A071433 E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Second Edition, Vol. 1, A K Peters, 2001, pp. 102, 109. %H A071433 Eric M. Schmidt, <a href="/A071433/b071433.txt">Table of n, a(n) for n = 1..10000</a> %H A071433 I. Caines et al., <a href="http://www.jstor.org/stable/2589561">Periods in taking and splitting games</a>, Amer. Math. Monthly, 106 (1999), 359-361. %H A071433 Achim Flammenkamp, <a href="http://www.uni-bielefeld.de/~achim/octal_sparse.html">Octal games</a> %Y A071433 a(n) = A046695(n+1). %K A071433 nonn,look %O A071433 1,2 %A A071433 _N. J. A. Sloane_ and _Sue Pope_, May 29 2002 %E A071433 Edited and extended by _Christian G. Bower_, Oct 22 2002