login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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.
LINKS
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}]
CROSSREFS
Sequence in context: A008481 A318473 A127669 * A056692 A331600 A039637
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jan 15 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:56 EDT 2024. Contains 371964 sequences. (Running on oeis4.)