Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116682
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116682 Sum of the odd parts in all partitions of n into distinct parts. +0
3
0, 1, 0, 4, 4, 9, 10, 17, 26, 38, 50, 66, 92, 116, 154, 203, 264, 326, 416, 514, 644, 802, 986, 1198, 1474, 1784, 2156, 2608, 3124, 3728, 4454, 5286, 6266, 7420, 8736, 10279, 12062, 14106, 16472, 19214, 22330, 25914, 30032, 34714, 40058, 46208, 53136 (list; graph; listen)
OFFSET

0,4

COMMENT

a(n)=Sum(k*A116681(n,k), k=0..n).

FORMULA

G.f.=product(1+x^j,j=1..infinity)*sum((2j-1)x^(2j-1)/(1+x^(2j-1)), j=1..infinity).

EXAMPLE

a(9)=38 because in the partitions of 9 into distinct parts, namely, [9],[8,1],[7,2],[6,3],[6,2,1],[5,4],[5,3,1] and [4,3,2], the sum of the odd parts is 9+1+7+3+1+5+5+3+1+3=38.

MAPLE

f:=product(1+x^j, j=1..70)*sum((2*j-1)*x^(2*j-1)/(1+x^(2*j-1)), j=1..40): fser:=series(f, x=0, 60): seq(coeff(fser, x, n), n=0..50);

CROSSREFS

Cf. A116681, A116683, A116684.

Sequence in context: A145445 A008794 A075709 this_sequence A088190 A092322 A050218

Adjacent sequences: A116679 A116680 A116681 this_sequence A116683 A116684 A116685

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 22 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research