|
%I #7 Feb 21 2019 23:44:06
%S 0,1,1,1,1,1,1,2,1,2,2,3,2,3,3,4,3,5,4,6,5,6,6,7,6,8,8,9,9,11,10,13,
%T 11,14,14,16,15,18,18,20,19,22,22,25,24,27,28,32,29,36,34,39,38,42,42,
%U 47,45,51,51,56,55,62,61,68,66,75,73,82,79,88,88,96,93,104,105,112,113,122,123
%N Number of partitions of n into squares where every part appears at least 2 times.
%H R. H. Hardin, <a href="/A161090/b161090.txt">Table of n, a(n) for n = 1..1000</a>
%F G.f.: -1 + Product_{j>=1} (1 + x^(2j^2)/(1-x^(j^2))). - _Emeric Deutsch_, Jun 21 2009]
%e a(12)=3 because we have 444, 441111, and 1^(12). - _Emeric Deutsch_, Jun 21 2009
%p g := -1+product(1+x^(2*j^2)/(1-x^(j^2)), j = 1 .. 10): gser := series(g, x = 0, 90): seq(coeff(gser, x, n), n = 1 .. 79); # _Emeric Deutsch_, Jun 21 2009
%K nonn
%O 1,8
%A _R. H. Hardin_, Jun 02 2009
|
