|
|
A284976
|
|
a(n) is the number of self-conjugate partitions of n which represent Chomp positions with Sprague-Grundy value 5.
|
|
0
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 2, 0, 3, 0, 4, 1, 2, 3, 6, 2, 4, 4, 4, 3, 8, 5, 7, 7, 9, 7, 7, 11, 14, 9, 5, 16, 13, 28, 16, 26, 18, 23, 27, 32, 27, 35, 33, 39, 34, 56
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,30
|
|
COMMENTS
|
The number of all Chomp positions with Sprague-Grundy value 5 are given in A284692.
|
|
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
|
|
|
|