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 A260968 #11 Aug 11 2015 12:14:47 %S A260968 1,2,7,67,534483 %N A260968 Number of all-small normal play partisan games born on or before day n. %C A260968 A game is all-small if it and all its followers other than 0 have options for both players, or equivalently (under normal play rules) if it and all its followers are infinitesimal. "All-small" is the traditional term, although Aaron Siegel prefers "dicotic", attributed to Michael Weimerskirch. %C A260968 The all-small games born by day n form a distributive lattice if additional minimal and maximal elements are added. %C A260968 The values up to a(4) are due to Aaron Siegel, computed using cgsuite. %D A260968 Aaron N. Siegel, Combinatorial Game Theory, AMS Graduate Texts in Mathematics Vol 146 (2013), p. 158. %H A260968 David Wolfe, <a href="http://library.msri.org/books/Book56/files/13wolfe.pdf">On day n</a>, pp. 125-131 in Games of No Chance 3, MSRI Publications 56, Cambridge, 2009. %Y A260968 Cf. A065401 (all games), A260967 (infinitesimal games). %K A260968 nonn,more %O A260968 0,2 %A A260968 _Christopher E. Thompson_, Aug 06 2015