|
%I #17 Apr 29 2022 04:30:16
%S 0,1,0,1,0,3,0,3,2,5,2,3,10,9,10,9,14,17,14,23,42,45,28,55,74,67,96,
%T 107,136,177,220,241,302,315,422,421,542,641,812,877,1022,1221,1490,
%U 1655,1970,2173,2754,3117,3542,3993,4976,5485,6508,7477,8758,9859,11530
%N Number of partitions of n which represent losing Chomp positions.
%H Timothy Herchen, <a href="/A112470/b112470.txt">Table of n, a(n) for n = 0..129</a>
%H Timothy Herchen, <a href="https://github.com/anematode/chomp/tree/winning_only">Chomp analysis code</a>, GitHub.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Chomp">Chomp</a>
%F a(n) = A000041(n) - A112471(n).
%e a(9)=5 since the positions 5+4, 5+2+1+1, 5+1+1+1+1, 4+2+1+1+1 and 2+2+2+2+1 are losing positions.
%Y Cf. A000041, A112471.
%K nonn
%O 0,6
%A _Henry Bottomley_, Sep 06 2005
%E Extended beyond a(40) by _Timothy Herchen_, Nov 03 2021
|
