|
%I #5 Mar 31 2012 13:50:43
%S 0,1,0,2,2,3,3,4,3,3,4,4,4,4,5,4,4,5,5,5,5,5,5,6,5,5,6,6,6,6,6,6,6,6,
%T 7,6,6,7,7,7,7,7,7,7,7,7,7,8,7,7,8,8,8,8,8,8,8,8,8,8,8,8,9,8,8,9,9,9,
%U 9,9,9,9,9,9,9,9,9,9,9,10,9,9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10
%N Minimum length of the self-conjugates partitions of n (0 if n=2; length of a partition is the number of parts).
%C There are no self-conjugate partitions of 2, so we set a(2)=0.
%e a(12)=4 because the self-conjugate partitions of 12 are [6,2,1,1,1,1],[5,3,2,1,1] and [4,4,2,2], having 6,5 and 4 parts, respectively; the smallest is 4.
%p g:=sum(t^k*x^(k^2)/product(1-t*x^(2*j),j=1..k),k=1..15): gser:=simplify(series(g,x=0,110)): 0,1,0,seq(ldegree(coeff(gser,x^n)),n=3..105); # sum(t^k*x^(k^2)/product(1-t*x^(2*j),j=1..k),k=1..infinity) is the bivariate g.f. for self-conjugate partitions according to weight (i.e. sum of the parts, marked by x) and number of parts (marked by t); - _Emeric Deutsch_, Apr 05 2006
%Y Cf. A000700, A047993.
%K easy,nonn
%O 0,4
%A _Naohiro Nomoto_, Feb 25 2002
%E More terms from _Emeric Deutsch_, Apr 05 2006
|
