|
|
A285007
|
|
a(n) is the number of self-conjugate partitions of n which represent Chomp positions with Sprague-Grundy value 10.
|
|
0
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 2, 2, 1, 0, 1, 2, 2, 4, 3, 3, 4, 6, 5, 7, 11, 7, 3, 10, 6, 8, 15, 12, 15, 6, 8
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,45
|
|
COMMENTS
|
The number of all Chomp positions with Sprague-Grundy value 10 are given in A284784.
|
|
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).
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|