|
|
A260969
|
|
Number of reduced normal play partisan games born on or before day n.
|
|
1
|
|
|
|
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
|
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
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|