|
Search: id:A092309
|
|
|
| A092309 |
|
Sum of smallest parts (counted with multiplicity) of all partitions of n. |
|
+0
12
|
|
| 1, 4, 7, 15, 19, 39, 46, 80, 106, 160, 201, 318, 390, 554, 729, 998, 1262, 1727, 2168, 2894, 3670, 4749, 5963, 7737, 9635, 12232, 15257, 19206, 23727, 29723, 36509, 45296, 55512, 68292, 83298, 102079, 123805, 150697, 182254, 220790, 265766
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
G.f.: Sum(n*x^n/(1-x^n)*Product(1/(1-x^k), k = n .. infinity), n = 1 .. infinity).
|
|
EXAMPLE
|
Partitions of 4 are: [1,1,1,1], [1,1,2], [2,2], [1,3], [4]; thus a(4)=4*1+2*1+2*2+1*1+1*4=15.
|
|
CROSSREFS
|
Cf. A092314 A092322 A092269 A092321 A092313 A092310 A092311 A092268
Cf. A046746.
Sequence in context: A064961 A137053 A049832 this_sequence A039669 A109622 A124286
Adjacent sequences: A092306 A092307 A092308 this_sequence A092310 A092311 A092312
|
|
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
|
