cp's OEIS Frontend

A182736 Sum of parts in all partitions of 2n that do not contain 1 as a part.

%I A182736 #20 Oct 07 2015 03:59:34
%S A182736 0,2,8,24,56,120,252,476,880,1584,2740,4620,7680,12428,19824,31170,
%T A182736 48224,73678,111384,166364,246120,360822,524216,755504,1080912,
%U A182736 1535050,2165592,3036096,4230632,5861828,8078820,11076362,15112384,20523492,27747128
%N A182736 Sum of parts in all partitions of 2n that do not contain 1 as a part.
%C A182736 Essentially this is a bisection (even indices) of A138880.
%H A182736 Alois P. Heinz, <a href="/A182736/b182736.txt">Table of n, a(n) for n = 0..1000</a>
%F A182736 a(n) = 2*n*A182746(n). - _Omar E. Pol_, Dec 05 2010
%p A182736 b:= proc(n,i) option remember; local p,q;
%p A182736       if n<0 then [0,0]
%p A182736     elif n=0 then [1,0]
%p A182736     elif i<2 then [0,0]
%p A182736     else p, q:= b(n,i-1), b(n-i,i);
%p A182736         [p[1]+q[1], p[2]+q[2]+q[1]*i]
%p A182736       fi
%p A182736     end:
%p A182736 a:= n-> b(2*n,2*n)[2]:
%p A182736 seq(a(n), n=0..34); # _Alois P. Heinz_, Dec 03 2010
%t A182736 b[n_] := (PartitionsP[n] - PartitionsP[n-1])*n; a[n_] := b[2n]; Table[a[n], {n, 0, 34}] (* _Jean-François Alcover_, Oct 07 2015 *)
%Y A182736 Cf. A135010, A138121, A138880, A182734, A182742.
%K A182736 nonn
%O A182736 0,2
%A A182736 _Omar E. Pol_, Dec 03 2010
%E A182736 More terms from _Alois P. Heinz_, Dec 03 2010