|
Search: id:A092313
|
|
|
| A092313 |
|
Sum of smallest parts (counted with multiplicity) of all partitions of n into odd parts. |
|
+0
10
|
|
| 1, 2, 6, 5, 12, 16, 21, 22, 43, 46, 60, 75, 92, 119, 164, 167, 220, 276, 320, 390, 491, 562, 665, 796, 949, 1109, 1342, 1530, 1804, 2144, 2442, 2843, 3342, 3837, 4471, 5147, 5894, 6780, 7841, 8910, 10204, 11718, 13282, 15168, 17337, 19594, 22225, 25210
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
G.f.: Sum((2*n-1)*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*1+3*1+2*3+1*1=16.
|
|
CROSSREFS
|
Cf. A092314 A092322 A092269 A092309 A092321 A092310 A092311 A092268
Sequence in context: A092744 A077174 A144652 this_sequence A009460 A085205 A094595
Adjacent sequences: A092310 A092311 A092312 this_sequence A092314 A092315 A092316
|
|
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
|
|
|
Search completed in 0.002 seconds
|
