|
|
A284689
|
|
The number of partitions of n which represent Chomp positions with Sprague-Grundy value 3.
|
|
2
|
|
|
0, 0, 0, 4, 0, 0, 4, 0, 4, 0, 6, 6, 8, 8, 8, 10, 15, 26, 17, 34, 39, 32, 73, 54, 99, 68, 133, 138, 167, 256, 261, 338, 357, 467, 545, 668, 775, 958, 1107, 1298, 1370, 1867, 2005, 2311, 2840, 3198, 3818, 4258, 4945, 5960, 6887, 8056, 9122, 10348, 12614, 14154
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Chomp positions with Sprague-Grundy value 0 are the losing positions. Their number is given in A112470.
|
|
REFERENCES
|
P. M. Grundy, Mathematics and games, Eureka 2 (1939), 6-8; reprinted (1964), Eureka 27, 9-11.
|
|
LINKS
|
Thomas S. Ferguson, Game Theory (lecture notes + exercise questions for a course on Combinatorial Game Theory).
P. M. Grundy, Mathematics and games, Eureka (The Archimedeans' Journal), No. 2, 1939, pp. 6-8. [Annotated scanned copy. My former colleague and coauthor Florence Jessie MacWilliams (nee Collinson), who was a student at Cambridge University in 1939, gave me this journal. - N. J. A. Sloane, Nov 17 2018]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|