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!)
A323302 Number of ways to arrange the parts of the integer partition with Heinz number n into a matrix with equal row-sums and equal column-sums. 6
1, 1, 1, 2, 1, 0, 1, 2, 2, 0, 1, 0, 1, 0, 0, 3, 1, 0, 1, 0, 0, 0, 1, 0, 2, 0, 2, 0, 1, 0, 1, 2, 0, 0, 0, 2, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 2, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 4, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 3, 0, 1, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
LINKS
EXAMPLE
The a(900) = 12 matrix-arrangements of (3,3,2,2,1,1):
[1 2 3] [1 3 2] [2 1 3] [2 3 1] [3 1 2] [3 2 1]
[3 2 1] [3 1 2] [2 3 1] [2 1 3] [1 3 2] [1 2 3]
.
[1 3] [1 3] [2 2] [2 2] [3 1] [3 1]
[2 2] [3 1] [1 3] [3 1] [1 3] [2 2]
[3 1] [2 2] [3 1] [1 3] [2 2] [1 3]
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]]}]];
ptnmats[n_]:=Union@@Permutations/@Select[Union@@(Tuples[Permutations/@#]&/@Map[primeMS, facs[n], {2}]), SameQ@@Length/@#&];
Table[Length[Select[ptnmats[n], And[SameQ@@Total/@#, SameQ@@Total/@Transpose[#]]&]], {n, 100}]
CROSSREFS
Positions of zeros are a superset of A106543.
Sequence in context: A346705 A177405 A362421 * A374212 A303903 A348515
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jan 13 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 July 26 12:47 EDT 2024. Contains 374634 sequences. (Running on oeis4.)