OFFSET
0,3
COMMENTS
Number of ways to fill a (not necessarily square) matrix with the parts of an integer partition of n so that the rows and columns are weakly decreasing.
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..1000
FORMULA
G.f.: 1 + Sum_{k>=1, l>=1} q^(k*l) * Product_{i=1..k} Product_{j=1..l} 1/(1 - q^(i+j-1)). - Seiichi Manyama, May 10 2026
EXAMPLE
The a(5) = 14 matrices:
[5] [4 1] [3 2] [3 1 1] [2 2 1] [2 1 1 1] [1 1 1 1 1]
.
[4] [3] [2 1]
[1] [2] [1 1]
.
[3] [2]
[1] [2]
[1] [1]
.
[2]
[1]
[1]
[1]
.
[1]
[1]
[1]
[1]
[1]
MATHEMATICA
Table[Sum[Length[Select[Union[Sort/@Tuples[IntegerPartitions[#, {k}]&/@ptn]], And@@OrderedQ/@Transpose[#]&]], {ptn, IntegerPartitions[n]}, {k, Min[ptn]}], {n, 30}]
PROG
(PARI) my(N=50, q='q+O('q^N)); Vec(1+sum(k=1, N, sum(l=1, N\k, q^(k*l)*prod(i=1, k, prod(j=1, l, 1/(1-q^(i+j-1))))))) \\ Seiichi Manyama, May 10 2026
CROSSREFS
Row sums of A395923.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jan 15 2019
STATUS
approved
