login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A117525 Total sum of parts of multiplicity 2 in all partitions of n. 0
0, 1, 0, 3, 3, 7, 9, 20, 22, 44, 56, 90, 119, 186, 236, 355, 461, 651, 848, 1177, 1506, 2050, 2626, 3482, 4443, 5823, 7353, 9524, 11983, 15307, 19163, 24277, 30174, 37920, 46925, 58463, 72006, 89155, 109209, 134418, 163973, 200605, 243700, 296696 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

FORMULA

G.f. for total sum of parts of multiplicity m in all partitions of n is (x^m/(1-x^m)^2-x^(m+1)/(1-x^(m+1))^2)/Product(1-x^i,i=1..infinity).

EXAMPLE

a(5)=3 because the partitions of 5 that have parts with multiplicity 2 are [3,1,1] and [2,2,1] and the sum of those parts is 1+2=3.

MAPLE

g:=(x^2/(1-x^2)^2-x^3/(1-x^3)^2)/Product(1-x^i, i=1..60): gser:=series(g, x=0, 55): seq(coeff(gser, x, n), n=1..50); - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 13 2006

CROSSREFS

Cf. A103628.

Sequence in context: A048240 A122012 A056295 * A075149 A161618 A202873

Adjacent sequences:  A117522 A117523 A117524 * A117526 A117527 A117528

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 26 2006

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), May 13 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 10:43 EST 2012. Contains 205614 sequences.