|
|
A284969
|
|
a(n) is the number of self-conjugate partitions of n which represent Chomp positions with Sprague-Grundy value 2.
|
|
0
|
|
|
0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 0, 3, 0, 4, 0, 6, 0, 7, 0, 9, 0, 11, 0, 13, 0, 15, 0, 18, 0, 20, 0, 23, 0, 26, 0, 29, 0, 32, 0, 36, 0, 39, 0, 43, 0, 47, 0, 51, 0, 55, 0, 60, 0, 64, 0, 69, 0, 74, 0, 79, 0, 84, 0, 90
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,15
|
|
COMMENTS
|
The number of all Chomp positions with Sprague-Grundy value 2 are given in A284688.
|
|
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
|
|
|
|