Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116930
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116930 Sum of parts, counted without multiplicities, in all partitions of n into odd parts. +0
2
1, 1, 4, 5, 10, 14, 22, 31, 44, 61, 82, 111, 145, 191, 245, 316, 399, 506, 631, 788, 973, 1200, 1468, 1792, 2174, 2630, 3167, 3802, 4547, 5422, 6445, 7638, 9029, 10642, 12515, 14679, 17181, 20061, 23379, 27185, 31554, 36551, 42268, 48787, 56224 (list; graph; listen)
OFFSET

1,3

COMMENT

a(n)=Sum(k*A116929(n,k),k=1..n).

FORMULA

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

EXAMPLE

a(5)=10 because the partitions of 5 into odd parts are [5],[3,1,1], and [1,1,1,1,1], with sum of the parts, counted without multiplicites 5 + (3+1) + 1 = 10.

MAPLE

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

CROSSREFS

Cf. A116929, A014153.

Sequence in context: A058335 A094415 A114517 this_sequence A073119 A002257 A101528

Adjacent sequences: A116927 A116928 A116929 this_sequence A116931 A116932 A116933

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 27 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research