login
A112472
Number of partitions of n which represent first player winning Chomp positions with unique winning moves.
23
0, 2, 2, 5, 4, 10, 10, 18, 21, 28, 44, 56, 70, 85, 115, 150, 185, 250, 317, 384, 472, 589, 757, 931, 1139, 1416, 1708, 2129, 2565, 3082, 3690, 4449, 5325, 6392, 7625, 9255, 10951, 12897, 15216, 18172
OFFSET
1,2
FORMULA
a(n) =A112471(n)-A112473(n)
EXAMPLE
a(6)=10 since the moves 6 to 1, 5+1 to 2+1, 4+2 to 3+2, 4+1+1 to 3+1+1, 3+3 to 3+2, 3+1+1+1 to 3+1+1, 2+2+2 to 2+2+1, 2+2+1+1 to 2+2+1, 2+1+1+1+1 to 2+1 and 1+1+1+1+1+1 to 1, are unique winning moves from those positions.
CROSSREFS
Sequence in context: A056439 A056444 A319925 * A240412 A292263 A338528
KEYWORD
nonn
AUTHOR
Henry Bottomley, Sep 06 2005
STATUS
approved