The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A182736 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A182736

Sum of parts in all partitions of 2n that do not contain 1 as a part.
(history; published version)

#20 by Alois P. Heinz at Wed Oct 07 03:59:34 EDT 2015

STATUS

proposed

approved

#19 by Jean-François Alcover at Wed Oct 07 03:36:14 EDT 2015

STATUS

editing

proposed

#18 by Jean-François Alcover at Wed Oct 07 03:36:06 EDT 2015

MATHEMATICA

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 *)

STATUS

approved

editing

#17 by Alois P. Heinz at Fri Jan 09 20:38:04 EST 2015

STATUS

editing

approved

#16 by Alois P. Heinz at Fri Jan 09 20:38:01 EST 2015

LINKS

Alois P. Heinz, <a href="/A182736/b182736.txt">Table of n, a(n) for n = 0..1000</a>

#15 by Alois P. Heinz at Fri Jan 09 20:35:53 EST 2015

MAPLE

b:= proc(n, i) option remember; local p, q;

if n<0 then [0, 0]

elif n=0 then [1, 0]

elif i<2 then [0, 0]

local else p, q:= b(n, i-1), b(n-i, i);

if n<0 then [0, 0]

elif n=0 then [1, 0]

elif i<2 then [0, 0]

else p, q:= b(n, i-1), b(n-i, i);

[p[1]+q[1], p[2]+q[2]+q[1]*i]

fi

seq (a(n), n=0..34); # Alois P. Heinz, Dec 03 2010

STATUS

approved

editing

#14 by Michel Marcus at Fri Apr 18 02:05:17 EDT 2014

STATUS

proposed

approved

#13 by Jon E. Schoenfield at Fri Apr 18 01:47:24 EDT 2014

STATUS

editing

proposed

#12 by Jon E. Schoenfield at Fri Apr 18 01:47:22 EDT 2014

EXTENSIONS

More terms and Maple program from Alois P. Heinz, Dec 03 2010

#11 by Jon E. Schoenfield at Fri Apr 18 01:47:09 EDT 2014

FORMULA

a(n) = 2*n*A182746(n). [- _Omar E. Pol, _, Dec 05 2010]

MAPLE

seq (a(n), n=0..34); # _Alois P. Heinz_, Dec 03 2010

STATUS

approved

editing