|
Search: id:A092265
|
|
|
| A092265 |
|
Sum of smallest parts of all partitions of n into distinct parts. |
|
+0
3
|
|
| 1, 2, 4, 5, 8, 10, 14, 16, 23, 26, 34, 40, 50, 58, 74, 83, 102, 120, 142, 164, 198, 226, 266, 308, 359, 412, 482, 548, 634, 730, 834, 950, 1094, 1240, 1416, 1609, 1826, 2068, 2350, 2648, 2994, 3382, 3806, 4280, 4826, 5408, 6070, 6806, 7619, 8522, 9534, 10632
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
G.f.: Sum(-1+Product(1+x^k, k = n .. infinity), n = 1 .. infinity).
G.f.: Sum(x^(k*(k+1)/2)/(1-x^k)/Product(1-x^i, i=1..k), k=1..infinity). - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 10 2004
|
|
CROSSREFS
|
Cf. A046746, A005895, A006128, A092319, A092316.
Cf. A026832.
Sequence in context: A018498 A002048 A067941 this_sequence A163295 A101274 A080222
Adjacent sequences: A092262 A092263 A092264 this_sequence A092266 A092267 A092268
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 14 2004
|
|
EXTENSIONS
|
More terms from Pab Ter (pabrlos(AT)yahoo.com), May 25 2004
|
|
|
Search completed in 0.002 seconds
|
