|
Search: id:A119907
|
|
|
| A119907 |
|
Number of partitions of n such that if k is the largest part, then k-2 occurs as a part. |
|
+0
1
|
|
| 0, 0, 0, 0, 1, 1, 3, 4, 7, 9, 15, 18, 27, 34, 47, 58, 79, 96, 127, 155, 199, 242, 308, 371, 465, 561, 694, 833, 1024, 1223, 1491, 1778, 2150, 2556, 3076, 3642, 4359, 5151, 6133, 7225, 8570, 10066, 11892, 13937, 16401, 19173, 22495, 26228, 30676, 35692, 41620
(list; graph; listen)
|
|
|
OFFSET
|
0,7
|
|
|
FORMULA
|
G.f. for number of partitions of n such that if k is the largest part, then k-m occurs as a part is Sum(x^(2*i-m)/Product(1-x^j,j=1..i),i=m+1..infinity).
|
|
CROSSREFS
|
Cf. A083751.
Sequence in context: A147953 A163468 A069183 this_sequence A158911 A086772 A086336
Adjacent sequences: A119904 A119905 A119906 this_sequence A119908 A119909 A119910
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 02 2006
|
|
EXTENSIONS
|
More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), Aug 14 2006
|
|
|
Search completed in 0.002 seconds
|
