login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A260969
Number of reduced normal play partisan games born on or before day n.
2
1, 3, 10, 61, 15845
OFFSET
0,2
COMMENTS
A game is reduced if it is the simplest among the set of games with values infinitesimally different from it.
The values up to a(4) are due to Aaron Siegel, computed using cgsuite.
REFERENCES
Aaron N. Siegel, Combinatorial Game Theory, AMS Graduate Texts in Mathematics Vol 146 (2013), p. 158.
LINKS
Dan Calistrate, The Reduced Canonical Form of a Game, pp. 409-416 in Games of No Chance, MSRI Publications 29, Cambridge (1998).
J. P. Grossman and Aaron N. Siegel, Reductions of partizan games, pp. 417-445 in Games Of No Chance 3, MSRI Publications 56, Cambridge (2009).
CROSSREFS
Cf. A065401 (all games), A260967 (infinitesimal games).
Sequence in context: A330624 A228773 A034889 * A305853 A160921 A042705
KEYWORD
nonn,more
AUTHOR
STATUS
approved