|
| |
|
|
A092311
|
|
Total number of largest parts in all partitions of n into odd parts.
|
|
10
| |
|
|
1, 2, 4, 5, 7, 10, 12, 14, 19, 23, 26, 33, 38, 44, 56, 63, 71, 88, 99, 114, 138, 155, 176, 208, 237, 269, 314, 357, 402, 468, 529, 594, 686, 772, 873, 999, 1119, 1260, 1431, 1608, 1804, 2039, 2284, 2554, 2884, 3219, 3590, 4032, 4493, 5011, 5603, 6231, 6928
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
FORMULA
| G.f.: Sum((x^(2*n-1)/(1-x^(2*n-1)))/Product((1-x^(2*k-1)), k=1..n), n=1..infinity).
|
|
|
EXAMPLE
| Partitions of 6 into odd parts are: [1,1,1,1,1,1], [1,1,1,3], [3,3], [1,5]; thus a(6)=6+1+2+1=10.
|
|
|
CROSSREFS
| Cf. A092314 A092322 A092269 A092309 A092321 A092313 A092310 A092268
Sequence in context: A047495 A005653 A188468 * A186386 A058212 A007997
Adjacent sequences: A092308 A092309 A092310 * A092312 A092313 A092314
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 16 2004
|
|
|
EXTENSIONS
| More terms from Pab Ter (pabrlos(AT)yahoo.com), May 25 2004
|
| |
|
|
