|
|
A365630
|
|
Number of partitions of n with exactly four part sizes.
|
|
6
|
|
|
1, 2, 5, 10, 20, 30, 52, 77, 117, 162, 227, 309, 414, 535, 692, 873, 1100, 1369, 1661, 2030, 2438, 2925, 3450, 4108, 4759, 5570, 6440, 7457, 8491, 9798, 11020, 12593, 14125, 15995, 17820, 20074, 22182, 24833, 27379, 30422, 33351, 36996, 40346, 44445, 48336, 53048, 57494
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
10,2
|
|
LINKS
|
|
|
FORMULA
|
G.f.: Sum_{0<i<j<k<l} x^(i+j+k+l)/( (1-x^i)*(1-x^j)*(1-x^k)*(1-x^l) ).
|
|
EXAMPLE
|
a(11) = 2 because we have 5+3+2+1, 4+3+2+1+1.
|
|
MAPLE
|
|
|
PROG
|
(Python)
from sympy.utilities.iterables import partitions
def A365630(n): return sum(1 for p in partitions(n) if len(p)==4) # Chai Wah Wu, Sep 14 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|