A112471 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A112471

Number of partitions of n which represent first player winning Chomp positions.

1, 0, 2, 2, 5, 4, 11, 12, 20, 25, 40, 53, 67, 92, 125, 167, 217, 280, 371, 467, 585, 747, 974, 1200, 1501, 1891, 2340, 2903, 3582, 4388, 5384, 6601, 8047, 9828, 11888, 14462, 17435, 20996, 25203, 30308, 36316

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

LINKS

Table of n, a(n) for n=0..40.

Wikipedia, Chomp

FORMULA

a(n) =A000041(n)-A112470(n) =A112472(n)+A112473(n)

EXAMPLE

a(6)=11 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+2+1 to 3+2 or to 3+1+1 or to 2+2+1, 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 winning moves.

CROSSREFS

Sequence in context: A238624 A124506 A264687 * A144366 A054156 A238834

Adjacent sequences: A112468 A112469 A112470 * A112472 A112473 A112474

KEYWORD

nonn

AUTHOR

Henry Bottomley, Sep 06 2005

STATUS

approved