cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A260967 Number of infinitesimal normal play partisan games born on or before day n.

Original entry on oeis.org

1, 2, 7, 292
Offset: 0

Views

Author

Keywords

Comments

A game g is infinitesimal if -x < g < x for all positive numbers x, or equivalently if its left and right stops are both 0.

References

  • Aaron N. Siegel, Combinatorial Game Theory, AMS Graduate Texts in Mathematics Vol 146 (2013), p. 158.

Crossrefs

Cf. A065401 (all games), A260968 (all-small games), A260969 (reduced games).

A368588 Number of misère-play left dead end games born by day n.

Original entry on oeis.org

1, 2, 4, 10, 52, 21278
Offset: 0

Views

Author

Aaron N. Siegel, Dec 31 2023

Keywords

Comments

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.

References

  • E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982.

Crossrefs

Showing 1-2 of 2 results.