|
%I #5 Apr 29 2022 04:28:56
%S 1,0,2,2,5,4,11,12,20,25,40,53,67,92,125,167,217,280,371,467,585,747,
%T 974,1200,1501,1891,2340,2903,3582,4388,5384,6601,8047,9828,11888,
%U 14462,17435,20996,25203,30308,36316
%N Number of partitions of n which represent first player winning Chomp positions.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Chomp">Chomp</a>
%F a(n) =A000041(n)-A112470(n) =A112472(n)+A112473(n)
%e 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.
%K nonn
%O 0,3
%A _Henry Bottomley_, Sep 06 2005
|
