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.

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

Original entry on oeis.org

0, 0, 0, 1, 2, 5, 6, 13, 17, 27, 36, 54, 66, 99, 128, 169, 221, 295, 367, 488, 610, 779, 993, 1253, 1525, 1955, 2426, 2986, 3684, 4563, 5519, 6840, 8298, 10097, 12298, 14874, 17716, 21635, 26002, 31105, 37081, 44581, 52916, 63259, 74852, 88703, 105543, 124752, 145740, 173522, 203999, 239737, 280424, 329929
Offset: 0

Views

Author

Gus Wiseman, Jan 13 2019

Keywords

Examples

			The a(8) = 17 integer partitions:
  (53), (62), (71),
  (332), (422), (431), (521), (611),
  (3221), (4211), (5111),
  (22211), (32111), (41111),
  (221111), (311111),
  (2111111).
		

Crossrefs

Programs

  • 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[IntegerPartitions[n],Select[ptnmats[Times@@Prime/@#],And[SameQ@@Total/@#,SameQ@@Total/@Transpose[#]]&]=={}&]],{n,10}]

Extensions

a(17)-a(53) from Chai Wah Wu, Jan 15 2019