login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A321646
Number of distinct row/column permutations of Ferrers diagrams of integer partitions of n.
5
1, 1, 2, 6, 15, 39, 108, 290, 781, 2050, 5434, 14210, 37150, 96347, 248250, 636278, 1620721, 4108340, 10361338, 26016060, 65019655, 161831393, 401090324, 990229108, 2435316984, 5967684036, 14572351628, 35464928382, 86033632280, 208062026930, 501676936146
OFFSET
0,3
FORMULA
a(n) = Sum_{k = 1..A000041(n)} A008480(A215366(n,k)) * A008480(A122111(A215366(n,k))).
EXAMPLE
The a(4) = 15 diagrams:
o o o o
.
o o o o o o o o o o o o o o
o o o o o o o o o o o o o o
.
o o o o o o o o
o o o o o o o o
o o o o o o o o
.
o
o
o
o
MATHEMATICA
conj[y_]:=If[Length[y]==0, y, Table[Length[Select[y, #>=k&]], {k, 1, Max[y]}]];
Table[Sum[Length[Permutations[y]]*Length[Permutations[conj[y]]], {y, IntegerPartitions[n]}], {n, 10}]
KEYWORD
nonn
AUTHOR
Gus Wiseman, Nov 15 2018
EXTENSIONS
a(11)-a(30) from Alois P. Heinz, Nov 15 2018
STATUS
approved