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.
%I A323303 #5 Jan 19 2019 08:47:21 %S A323303 1,1,1,2,1,2,1,2,2,2,1,3,1,2,2,3,1,3,1,3,2,2,1,4,2,2,2,3,1,6,1,2,2,2, %T A323303 2,10,1,2,2,4,1,6,1,3,3,2,1,5,2,3,2,3,1,4,2,4,2,2,1,12,1,2,3,4,2,6,1, %U A323303 3,2,6,1,10,1,2,3,3,2,6,1,5,3,2,1,12,2,2 %N A323303 Number of ways to arrange the prime indices of n into a matrix with equal column-sums. %C A323303 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. %e A323303 The a(90) = 16 matrix-arrangements of (3,2,2,1) with equal column-sums: %e A323303 [1 2] [2 1] [2 3] [3 2] %e A323303 [3 2] [2 3] [2 1] [1 2] %e A323303 . %e A323303 [1] [1] [1] [2] [2] [2] [2] [2] [2] [3] [3] [3] %e A323303 [2] [2] [3] [1] [1] [2] [2] [3] [3] [1] [2] [2] %e A323303 [2] [3] [2] [2] [3] [1] [3] [1] [2] [2] [1] [2] %e A323303 [3] [2] [2] [3] [2] [3] [1] [2] [1] [2] [2] [1] %t A323303 primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]; %t A323303 facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]]; %t A323303 ptnmats[n_]:=Union@@Permutations/@Select[Union@@(Tuples[Permutations/@#]&/@Map[primeMS,facs[n],{2}]),SameQ@@Length/@#&]; %t A323303 Table[Length[Select[ptnmats[n],SameQ@@Total/@Transpose[#]&]],{n,100}] %Y A323303 Cf. A006052, A008480, A056239, A112798, A118914, A120733, A319056, A321719. %Y A323303 Cf. A323295, A323300, A323302, A323305, A323306, A323347, A323349. %K A323303 nonn %O A323303 1,4 %A A323303 _Gus Wiseman_, Jan 17 2019