The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #14 May 05 2018 02:40:40
%S 1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,
%T 0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,1,0,0,0,
%U 0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0
%N Number of partitions of n into at most 1 copy of 2^3, 2 copies of 3^3, 3 copies of 4^3, ... .
%H Seiichi Manyama, <a href="/A304002/b304002.txt">Table of n, a(n) for n = 0..5000</a>
%F G.f.: Product_{k>=2} (1-x^(k^4))/(1-x^(k^3)).
%e n | | a(n)
%e ------+----------------+------
%e 8 | 8 | 1
%e 27 | 27 | 1
%e 35 | 27+8 | 1
%e 54 | 27+27 | 1
%e 62 | 27+27+8 | 1
%e 64 | 64 | 1
%e 72 | 64+8 | 1
%e 91 | 64+27 | 1
%e 99 | 64+27+8 | 1
%e ...
%e 216 | 216, 125+64+27 | 2
%Y Cf. A087153, A303947, A304021.
%K nonn
%O 0
%A _Seiichi Manyama_, May 04 2018