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 A071434 #13 Jan 11 2017 18:38:25 %S A071434 1,1,2,2,3,3,1,1,4,4,3,3,2,2,1,1,4,4,2,2,6,6,4,4,1,1,2,2,7,7,1,1,4,4, %T A071434 3,3,2,2,1,1,4,4,6,6,7,7,4,4,1,1,2,2,8,8,5,5,4,4,7,7,2,2,1,1,8,8,6,6, %U A071434 7,7,4,4,1,1,2,2,3,3,1,1,4,4,7,7,2,2,1,1,8,8,2,2,7,7,4,4,1,1,2,2,8,8 %N A071434 Sprague-Grundy values for octal game .1377. %C A071434 Octal games .074-.077 have values a(n-1). Octal games .440-.443 and .460-.463 have values a(n-2). %C A071434 Sequence is eventually periodic with period 24. The last exception is at n=140. %D A071434 E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982; see Chapter 4, p. 102. %H A071434 Eric M. Schmidt, <a href="/A071434/b071434.txt">Table of n, a(n) for n = 1..200</a> %H A071434 Achim Flammenkamp, <a href="http://www.uni-bielefeld.de/~achim/octal_sparse.html">Octal games</a> %H A071434 <a href="/index/Rec#order_24">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1). %F A071434 a(2n-1) = a(2n) = A002186(n). %K A071434 nonn %O A071434 1,3 %A A071434 _N. J. A. Sloane_ and _Sue Pope_, May 29 2002 %E A071434 Edited and extended by _Christian G. Bower_, Oct 22 2002