|
Search: id:A092269
|
|
|
| A092269 |
|
Total number of smallest parts in all partitions of n. |
|
+0
11
|
|
| 1, 3, 5, 10, 14, 26, 35, 57, 80, 119, 161, 238, 315, 440, 589, 801, 1048, 1407, 1820, 2399, 3087, 3998, 5092, 6545, 8263, 10486, 13165, 16562, 20630, 25773, 31897, 39546, 48692, 59960, 73423, 89937, 109553, 133439, 161840, 196168, 236843
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
G.f.: Sum(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+2+2+1+1=10.
|
|
CROSSREFS
|
Cf. A092314 A092322 A092309 A092321 A092313 A092310 A092311 A092268
Cf. A006128.
Sequence in context: A008610 A078411 A137630 this_sequence A089483 A023602 A024452
Adjacent sequences: A092266 A092267 A092268 this_sequence A092270 A092271 A092272
|
|
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
|
