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 A368588 #21 Jun 22 2024 15:57:26 %S A368588 1,2,4,10,52,21278 %N A368588 Number of misère-play left dead end games born by day n. %C A368588 A partizan combinatorial game G is a left dead end if no subposition of G has any left options. In normal play, every left dead end is equal to a nonpositive integer. In misère play, the left dead ends have a more intricate structure; this sequence counts the misère-inequivalent left dead ends with birthday <= n. %D A368588 E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982. %H A368588 Aaron N. Siegel, <a href="https://arxiv.org/abs/2312.16259">On the general dead-ending universe of partizan games</a>, arXiv:2312.16259 [math.CO], 2023. %Y A368588 Cf. A065401, A047995, A260969. %K A368588 nonn,hard,more %O A368588 0,2 %A A368588 _Aaron N. Siegel_, Dec 31 2023