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”).

A323436
Number of plane partitions whose parts are the prime indices of n.
17
1, 1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 2, 2, 5, 1, 4, 1, 3, 2, 2, 1, 5, 2, 2, 3, 3, 1, 4, 1, 7, 2, 2, 2, 8, 1, 2, 2, 5, 1, 4, 1, 3, 3, 2, 1, 7, 2, 4, 2, 3, 1, 7, 2, 5, 2, 2, 1, 8, 1, 2, 3, 11, 2, 4, 1, 3, 2, 4, 1, 12, 1, 2, 4, 3, 2, 4, 1, 7, 5, 2, 1, 8, 2, 2
OFFSET
0,5
COMMENTS
Number of ways to fill a Young diagram with the prime indices of n such that all rows and columns are weakly decreasing.
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
EXAMPLE
The a(120) = 12 plane partitions:
32111
.
311 321 3111 3211
21 11 2 1
.
31 32 311 321
21 11 2 1
1 1 1 1
.
31 32
2 1
1 1
1 1
.
3
2
1
1
1
MATHEMATICA
primeMS[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
facs[n_]:=If[n<=1, {{}}, Join@@Table[Map[Prepend[#, d]&, Select[facs[n/d], Min@@#>=d&]], {d, Rest[Divisors[n]]}]];
ptnplane[n_]:=Union[Map[Reverse@*primeMS, Join@@Permutations/@facs[n], {2}]];
Table[Length[Select[ptnplane[y], And[And@@GreaterEqual@@@#, And@@(GreaterEqual@@@Transpose[PadRight[#]])]&]], {y, 100}]
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jan 15 2019
STATUS
approved