

A284965


a(n) is the number of selfconjugate partitions of n which represent Chomp positions with SpragueGrundy value 1.


0



0, 0, 0, 0, 0, 1, 0, 2, 0, 2, 0, 3, 0, 3, 0, 4, 0, 4, 0, 5, 0, 5, 0, 6, 0, 6, 0, 7, 0, 7, 0, 8, 0, 8, 0, 9, 0, 9, 0, 10, 0, 10, 0, 11, 0, 11, 0, 12, 0, 12, 0, 13, 0, 13, 0, 14, 0, 14, 0, 15, 0, 15, 0, 16, 0, 16, 0, 17, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,8


COMMENTS

The number of all Chomp positions with SpragueGrundy value 1 are given in A284687.


REFERENCES

P. M. Grundy, Mathematics and games, Eureka 2 (1939), 68; reprinted (1964), Eureka 27, 911.


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. 68. [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



