|
|
A303939
|
|
Number of partitions of n into at most 2 copies of 1, 3 copies of 2, 4 copies of 3, ... .
|
|
3
|
|
|
1, 1, 2, 2, 4, 5, 8, 10, 14, 18, 25, 32, 43, 54, 71, 88, 114, 141, 180, 221, 278, 340, 423, 515, 634, 768, 938, 1131, 1372, 1646, 1985, 2371, 2844, 3383, 4037, 4783, 5682, 6709, 7936, 9339, 11004, 12908, 15155, 17724, 20740, 24186, 28214, 32812, 38165, 44271, 51354
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
FORMULA
|
G.f.: Product_{k>=1} (1-x^(k*(k+2)))/(1-x^k).
|
|
EXAMPLE
|
a(5) = 5 because we have [5], [4,1], [3,2], [3,1,1] and [2,2,1].
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|