|
| |
|
|
A092268
|
|
Total number of smallest parts in all partitions of n into odd parts.
|
|
10
| |
|
|
1, 2, 4, 5, 8, 12, 15, 20, 29, 36, 46, 61, 74, 95, 122, 145, 180, 224, 268, 328, 399, 474, 567, 682, 807, 955, 1136, 1330, 1564, 1842, 2140, 2499, 2914, 3375, 3917, 4533, 5220, 6014, 6929, 7942, 9102, 10430, 11898, 13582, 15489, 17600, 19999, 22706, 25719
(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=n..infinity), 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+3+2+1=12.
|
|
|
CROSSREFS
| Cf. A092314 A092322 A092269 A092309 A092321 A092313 A092310 A092311
Cf. A067588.
Sequence in context: A190190 A063465 A035001 * A069259 A102186 A039842
Adjacent sequences: A092265 A092266 A092267 * A092269 A092270 A092271
|
|
|
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
|
| |
|
|
