|
|
A309099
|
|
Number of partitions of n avoiding the partition (4,3,1).
|
|
4
|
|
|
1, 1, 2, 3, 5, 7, 11, 15, 21, 28, 37, 46, 59, 72, 87, 104, 124, 144, 168, 192, 220, 250, 282, 314, 352, 391, 432, 475, 522, 569, 622, 675, 732, 791, 852, 915, 985, 1055, 1127, 1201, 1281, 1361, 1447, 1533, 1623, 1717, 1813, 1909, 2013, 2118, 2227, 2338, 2453
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
We say a partition alpha contains mu provided that one can delete rows and columns from (the Ferrers board of) alpha and then top/right justify to obtain mu. If this is not possible then we say alpha avoids mu. For example, the only partitions avoiding (2,1) are those whose Ferrers boards are rectangles.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
b:= proc(n) option remember; `if`(n<1, [0$2],
(p-> p+[numtheory[tau](n), p[1]])(b(n-1)))
end:
a:= n-> b(n+1)[2]+`if`(n=0, 1, n*(1-n)):
|
|
PROG
|
(PARI) a(n) = if(n == 0, 1, sum(i = 1, n, (n - i + 1) * numdiv(i)) - n * (n - 1)) \\ Mikhail Kurkov, Dec 20 2023 [verification needed]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,changed
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|