|
|
A285006
|
|
a(n) is the number of self-conjugate partitions of n which represent Chomp positions with Sprague-Grundy value 9.
|
|
0
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 3, 0, 2, 2, 3, 3, 3, 3, 2, 3, 3, 3, 4, 3, 7, 4, 5, 8, 7, 8, 15, 9, 15, 14, 8, 8, 20, 19, 21
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,41
|
|
COMMENTS
|
The number of all Chomp positions with Sprague-Grundy value 9 are given in A284782.
|
|
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
|
|
|
|