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 A065401 #21 Oct 18 2018 04:57:45 %S A065401 1,4,22,1474 %N A065401 Number of normal play partisan games born on or before day n. %C A065401 Fraser and Wolfe prove upper and lower bounds on a(n+1) in terms of a(n). In particular they give the (probably quite weak) lower bound of 3*10^12 for a(4). - _Christopher E. Thompson_, Aug 06 2015 %D A065401 Dan Calistrate, Marc Paulhus and David Wolfe, On the lattice structure of finite games, in More Games of No Chance (Berkeley, CA, 2000), Math. Sci. Res. Inst. Publ., 42, Cambridge Univ. Press, Cambridge, 2002, pp. 25-30. %D A065401 J. H. Conway, On Numbers and Games, Academic Press, NY, 1976. %D A065401 Aaron N. Siegel, Combinatorial Game Theory, AMS Graduate Texts in Mathematics Vol 146 (2013), p. 158. %H A065401 William E. Fraser and David Wolfe, <a href="http://dx.doi.org/10.1016/j.tcs.2003.05.001">Counting the number of games</a>, Theoret. Comput. Sci. 313 (2004), pp. 527-532. %F A065401 a(n) = A125990(2*A114561(n)). - _Antti Karttunen_, Oct 18 2018 %Y A065401 Cf. A065402, A065407, A047995, A037142, A114561, A125990, A126011. %K A065401 nonn,hard,more %O A065401 0,2 %A A065401 _R. K. Guy_, Nov 23 2001 %E A065401 _Dean Hickerson_ and Robert Li found a(3) in 1974.