login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260969 Number of reduced normal play partisan games born on or before day n. 1
1, 3, 10, 61, 15845 (list; graph; refs; listen; history; text; internal format)
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

Table of n, a(n) for n=0..4.

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 A034889 A228773 * A305853 A160921 A042705

Adjacent sequences:  A260966 A260967 A260968 * A260970 A260971 A260972

KEYWORD

nonn,more

AUTHOR

Christopher E. Thompson, Aug 06 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 25 03:15 EST 2021. Contains 340415 sequences. (Running on oeis4.)