login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Sum over all partitions of n of the sum of the parts that are smaller than the largest part.
1

%I #6 May 10 2013 12:45:45

%S 0,0,1,3,9,17,36,61,106,171,273,411,627,916,1326,1890,2667,3698,5102,

%T 6943,9388,12588,16747,22113,29051,37914,49191,63515,81589,104315,

%U 132799,168351,212540,267395,335085,418574,521093,646763,800164,987315

%N Sum over all partitions of n of the sum of the parts that are smaller than the largest part.

%C a(n)=Sum(k*A116687(n,k),k>=0).

%F G.f.=sum(x^i*sum(jx^j/(1-x^j), j=1..i-1)/product(1-x^q, q=1..i), i=1..infinity).

%F a(n) = n*A000041(n) - A092321(n). - _Vladeta Jovovic_, Feb 24 2006

%e a(5)=9 because the partitions of 5 are [5],[4,(1)],[3,(2)],[3,(1),(1)],

%e [2,2,(1)],[2,(1),(1),(1)] and [1,1,1,1,1] and the sum of the parts (shown between parentheses) that are smaller than the largest part is 1+2+1+1+1+1+1+1=9.

%p f:=sum(x^i*sum(j*x^j/(1-x^j),j=1..i-1)/product(1-x^q,q=1..i),i=1..55): fser:=series(f,x=0,50): seq(coeff(fser,x^n),n=1..47);

%Y Cf. A116687.

%K nonn

%O 1,4

%A _Emeric Deutsch_, Feb 23 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 11:05 EDT 2024. Contains 376196 sequences. (Running on oeis4.)