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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067588 Total number of parts in all partitions of n into odd parts. 3
0, 1, 2, 4, 6, 9, 14, 19, 26, 36, 48, 62, 82, 104, 132, 169, 210, 260, 324, 396, 484, 592, 714, 860, 1036, 1238, 1474, 1756, 2078, 2452, 2894, 3396, 3976, 4654, 5422, 6309, 7332, 8490, 9816, 11338, 13060, 15018, 17254, 19774, 22630, 25878, 29524, 33642 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Starting with "1" = triangle A097304 * [1, 2, 3,...] [From Gary W. Adamson, Apr 09 2010]

LINKS

Table of n, a(n) for n=0..47.

FORMULA

G.f.: G(x)*H(x) where G(x) = Sum_{k>=1) x^(2*k-1)/(1-x^(2*k-1)) is g.f. for the number of odd divisors of n (cf. A001227) and H(x) = Product_{k>=1) (1+x^k) is g.f. for the number of partitions of n into odd parts (cf. A000009). Convolution of A001227 and A000009: Sum_{k=0..n} A001227(k)*A000009(n-k). - Vladeta Jovovic, Feb 04 2002

G.f.: Sum_{n>0} n*x^n/Product_{k=1..n} (1-x^(2*k)). - Vladeta Jovovic, Dec 15 2003

CROSSREFS

Cf. A067589, A006128, A066897, A066898.

Cf. A097304 [From Gary W. Adamson, Apr 09 2010]

Sequence in context: A113753 A024457 A117842 * A003402 A218004 A034748

Adjacent sequences:  A067585 A067586 A067587 * A067589 A067590 A067591

KEYWORD

easy,nonn

AUTHOR

Naohiro Nomoto, Jan 31 2002

EXTENSIONS

Corrected by James A. Sellers, May 31 2007

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified June 25 11:48 EDT 2017. Contains 288709 sequences.