cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A323347 Number of integer partitions of n whose parts can be arranged into a (not necessarily square) matrix with equal row-sums and equal column-sums.

This page as a plain text file.
%I A323347 #20 Jan 16 2019 19:44:50
%S A323347 1,1,2,2,3,2,5,2,5,3,6,2,11,2,7,7,10,2,18,2,17,13,9,2,50,3,10,24,34,2,
%T A323347 85,2,51,46,12,9,261,2,13,80,257,2,258,2,323,431,15,2,1533,3,227,206,
%U A323347 1165,2,971,483,2409,309,18,2
%N A323347 Number of integer partitions of n whose parts can be arranged into a (not necessarily square) matrix with equal row-sums and equal column-sums.
%C A323347 Rectangles must be of size m X k where m, k are divisors of n and mk <= n. This implies that a(p) = 2 for p prime, since the only allowable rectangles must be of size 1 X 1 corresponding to the partition (p), or 1 X p or p X 1 corresponding to the partition (1,1,...,1). Similarly, a(p^2) = 3 since the allowable rectangles must be of sizes 1 X 1 (partition (p^2)), 1 X p or p X 1 (partition (p,p,...,p)), 1 X p^2, p^2 X 1 and p X p (partition (1,1,...,1)). - _Chai Wah Wu_, Jan 14 2019
%F A323347 a(p) = 2 and a(p^2) = 3 for p prime (see comment). - _Chai Wah Wu_, Jan 14 2019
%e A323347 The a(8) = 5 integer partitions are (8), (44), (2222), (3311), (11111111).
%e A323347 The a(12) = 11 integer partitions (C = 12):
%e A323347   (C)
%e A323347   (66)
%e A323347   (444)
%e A323347   (3333)
%e A323347   (4422)
%e A323347   (5511)
%e A323347   (222222)
%e A323347   (332211)
%e A323347   (22221111)
%e A323347   (222111111)
%e A323347   (111111111111)
%e A323347 For example, the arrangements of (222111111) are:
%e A323347   [1 1 2] [1 1 2] [1 2 1] [1 2 1] [2 1 1] [2 1 1]
%e A323347   [1 2 1] [2 1 1] [1 1 2] [2 1 1] [1 1 2] [1 2 1]
%e A323347   [2 1 1] [1 2 1] [2 1 1] [1 1 2] [1 2 1] [1 1 2]
%t A323347 primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
%t A323347 facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
%t A323347 ptnmats[n_]:=Union@@Permutations/@Select[Union@@(Tuples[Permutations/@#]&/@Map[primeMS,facs[n],{2}]),SameQ@@Length/@#&];
%t A323347 Table[Length[Select[IntegerPartitions[n],!Select[ptnmats[Times@@Prime/@#],And[SameQ@@Total/@#,SameQ@@Total/@Transpose[#]]&]=={}&]],{n,10}]
%Y A323347 A000041(n) = A323348(n) + a(n).
%Y A323347 Cf. A006052, A007016, A120733, A319056, A319066, A321719.
%Y A323347 Cf. A323300, A323302, A323304, A323306, A323349.
%K A323347 nonn,more
%O A323347 0,3
%A A323347 _Gus Wiseman_, Jan 13 2019
%E A323347 a(17)-a(53) from _Chai Wah Wu_, Jan 15 2019
%E A323347 a(54)-a(59) from _Chai Wah Wu_, Jan 16 2019