A319056 -id:A319056 - cp's OEIS frontend

A321723 Number of non-normal magic squares whose entries are all 0 or 1 and sum to n.

1, 1, 0, 0, 9, 20, 96, 656, 5584, 48913, 494264, 5383552, 65103875, 840566080, 11834159652, 176621049784, 2838040416201, 48060623405312

Offset: 0

Gus Wiseman, Nov 18 2018

A non-normal magic square is a square matrix with row sums, column sums, and both diagonals all equal to d, for some d|n.

			The a(4) = 9 magic squares:
  [1 1]
  [1 1]
.
  [1 0 0 0][1 0 0 0][0 1 0 0][0 1 0 0][0 0 1 0][0 0 1 0][0 0 0 1][0 0 0 1]
  [0 0 1 0][0 0 0 1][0 0 1 0][0 0 0 1][1 0 0 0][0 1 0 0][1 0 0 0][0 1 0 0]
  [0 0 0 1][0 1 0 0][1 0 0 0][0 0 1 0][0 1 0 0][0 0 0 1][0 0 1 0][1 0 0 0]
  [0 1 0 0][0 0 1 0][0 0 0 1][1 0 0 0][0 0 0 1][1 0 0 0][0 1 0 0][0 0 1 0]

Wikipedia, Magic square
Index entries for sequences related to magic squares

Cf. A006052, A007016, A057151, A068313, A101370, A104602, A120732, A271103, A319056, A319616.

Cf. A321717, A321718, A321719, A321720, A321721, A321722.

prs2mat[prs_]:=Table[Count[prs,{i,j}],{i,Union[First/@prs]},{j,Union[Last/@prs]}];
multsubs[set_,k_]:=If[k==0,{{}},Join@@Table[Prepend[#,set[[i]]]&/@multsubs[Drop[set,i-1],k-1],{i,Length[set]}]];
Table[Length[Select[Subsets[Tuples[Range[n],2],{n}],And[Union[First/@#]==Range[Max@@First/@#]==Union[Last/@#],SameQ@@Join[{Tr[prs2mat[#]],Tr[Reverse[prs2mat[#]]]},Total/@prs2mat[#],Total/@Transpose[prs2mat[#]]]]&]],{n,5}]

a(n) >= A007016(n) with equality if n is prime. - Chai Wah Wu, Jan 15 2019

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

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

A321732 Number of nonnegative integer square matrices with sum of entries equal to n, no zero rows or columns, and the same row sums as column sums.

Original entry on oeis.org

1, 1, 3, 11, 53, 317, 2293, 19435, 188851, 2068417, 25203807, 338117445, 4951449055, 78589443061, 1343810727205, 24626270763109, 481489261372381, 10004230113283129, 220125503239710879, 5113204953106107087, 125037079246130168973

Offset: 0

Gus Wiseman, Nov 18 2018

nonn

			The a(3) = 11 matrices:
  [3]
.
  [2 0] [1 1] [1 0] [0 1]
  [0 1] [1 0] [0 2] [1 1]
.
  [1 0 0] [1 0 0] [0 1 0] [0 1 0] [0 0 1] [0 0 1]
  [0 1 0] [0 0 1] [1 0 0] [0 0 1] [1 0 0] [0 1 0]
  [0 0 1] [0 1 0] [0 0 1] [1 0 0] [0 1 0] [1 0 0]

Ludovic Schwob, Table of n, a(n) for n = 0..30

Cf. A000700, A000701, A006052, A007016, A120732, A319056, A320451, A321718, A321719, A321722, A321733, A321734, A321735, A321736, A321739.

prs2mat[prs_]:=Table[Count[prs,{i,j}],{i,Union[First/@prs]},{j,Union[Last/@prs]}];
multsubs[set_,k_]:=If[k==0,{{}},Join@@Table[Prepend[#,set[[i]]]&/@multsubs[Drop[set,i-1],k-1],{i,Length[set]}]];
Table[Length[Select[multsubs[Tuples[Range[n],2],n],And[Union[First/@#]==Range[Max@@First/@#]==Union[Last/@#],Total/@prs2mat[#]==Total/@Transpose[prs2mat[#]]]&]],{n,5}]

a(7) onwards from Ludovic Schwob, Apr 03 2024

A322785 Number of uniform multiset partitions of uniform multisets of size n whose union is an initial interval of positive integers.

Original entry on oeis.org

1, 1, 4, 4, 12, 4, 48, 4, 183, 297, 1186, 4, 33950, 4, 139527, 1529608, 4726356, 4, 229255536, 4, 3705777010, 36279746314, 13764663019, 4, 14096735197959, 5194673049514, 7907992957755, 2977586461058927, 13426396910491001, 4, 1350012288268171854, 4, 59487352224070807287

Offset: 0

Gus Wiseman, Dec 26 2018

nonn

A multiset is uniform if all multiplicities are equal. A multiset partition is uniform if all parts have the same size.

			The a(1) = 1 though a(6) = 48 multiset partitions:
  {1}  {11}    {111}      {1111}        {11111}          {111111}
       {12}    {123}      {1122}        {12345}          {111222}
       {1}{1}  {1}{1}{1}  {1234}        {1}{1}{1}{1}{1}  {112233}
       {1}{2}  {1}{2}{3}  {11}{11}      {1}{2}{3}{4}{5}  {123456}
                          {11}{22}                       {111}{111}
                          {12}{12}                       {111}{222}
                          {12}{34}                       {112}{122}
                          {13}{24}                       {112}{233}
                          {14}{23}                       {113}{223}
                          {1}{1}{1}{1}                   {122}{133}
                          {1}{1}{2}{2}                   {123}{123}
                          {1}{2}{3}{4}                   {123}{456}
                                                         {124}{356}
                                                         {125}{346}
                                                         {126}{345}
                                                         {134}{256}
                                                         {135}{246}
                                                         {136}{245}
                                                         {145}{236}
                                                         {146}{235}
                                                         {156}{234}
                                                         {11}{11}{11}
                                                         {11}{12}{22}
                                                         {11}{22}{33}
                                                         {11}{23}{23}
                                                         {12}{12}{12}
                                                         {12}{12}{33}
                                                         {12}{13}{23}
                                                         {12}{34}{56}
                                                         {12}{35}{46}
                                                         {12}{36}{45}
                                                         {13}{13}{22}
                                                         {13}{24}{56}
                                                         {13}{25}{46}
                                                         {13}{26}{45}
                                                         {14}{23}{56}
                                                         {14}{25}{36}
                                                         {14}{26}{35}
                                                         {15}{23}{46}
                                                         {15}{24}{36}
                                                         {15}{26}{34}
                                                         {16}{23}{45}
                                                         {16}{24}{35}
                                                         {16}{25}{34}
                                                         {1}{1}{1}{1}{1}{1}
                                                         {1}{1}{1}{2}{2}{2}
                                                         {1}{1}{2}{2}{3}{3}
                                                         {1}{2}{3}{4}{5}{6}

Andrew Howroyd, Table of n, a(n) for n = 0..100

Row sums of A322788.

Cf. A000040, A038041, A072774, A100778, A299353, A306017, A306018, A306021, A317583, A317584, A319056, A319189, A321721, A322705, A322784, A322788.

sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
mps[set_]:=Union[Sort[Sort/@(#/.x_Integer:>set[[x]])]&/@sps[Range[Length[set]]]];
Table[Sum[Length[Select[mps[m],SameQ@@Length/@#&]],{m,Table[Join@@Table[Range[n/d],{d}],{d,Divisors[n]}]}],{n,8}]

a(n) = 4 <=> n in { A000040 }. - Alois P. Heinz, Feb 03 2022

More terms from Alois P. Heinz, Jan 30 2019

Terms a(14) and beyond from Andrew Howroyd, Feb 03 2022

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.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Jan 13 2019

nonn

The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).

			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]

Positions of zeros are a superset of A106543.
Cf. A000005, A001222, A006052, A007016, A008480, A056239, A112798, A120733, A319056, A321719, A321721.
Cf. A323300, A323303, A323305, A323306, A323347, A323349.

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}]

A321736 Number of non-isomorphic weight-n multiset partitions whose part-sizes are also their vertex-degrees.

Original entry on oeis.org

1, 1, 2, 4, 9, 17, 42, 92, 231, 579, 1577

Offset: 0

Gus Wiseman, Nov 19 2018

Also the number of nonnegative integer square matrices up to row and column permutations with sum of elements equal to n and no zero rows or columns, with the same multiset of row sums as of column sums.

The weight of a multiset partition is the sum of sizes of its parts. Weight is generally not the same as number of vertices.

			Non-isomorphic representatives of the a(1) = 1 through a(5) = 17 multiset partitions:
  {{1}}  {{1,1}}    {{1,1,1}}      {{1,1,1,1}}        {{1,1,1,1,1}}
         {{1},{2}}  {{1},{2,2}}    {{1,1},{2,2}}      {{1,1},{1,2,2}}
                    {{2},{1,2}}    {{1,2},{1,2}}      {{1,1},{2,2,2}}
                    {{1},{2},{3}}  {{1},{2,2,2}}      {{1,2},{1,2,2}}
                                   {{2},{1,2,2}}      {{1},{2,2,2,2}}
                                   {{1},{1},{2,3}}    {{2},{1,2,2,2}}
                                   {{1},{2},{3,3}}    {{1},{2,2},{3,3}}
                                   {{1},{3},{2,3}}    {{1},{2,3},{2,3}}
                                   {{1},{2},{3},{4}}  {{1},{2},{3,3,3}}
                                                      {{1},{3},{2,3,3}}
                                                      {{2},{1,2},{3,3}}
                                                      {{2},{1,3},{2,3}}
                                                      {{3},{3},{1,2,3}}
                                                      {{1},{2},{2},{3,4}}
                                                      {{1},{2},{3},{4,4}}
                                                      {{1},{2},{4},{3,4}}
                                                      {{1},{2},{3},{4},{5}}

Cf. A000700, A007716, A057150, A120732, A319056, A319616, A320451, A321719, A321721, A321722, A321724, A321732, A321733, A321735, A321739.

A321739 Number of non-isomorphic weight-n set multipartitions (multisets of sets) whose part-sizes are also their vertex-degrees.

Original entry on oeis.org

1, 1, 1, 2, 4, 6, 12, 21, 46, 94, 208

Offset: 0

Gus Wiseman, Nov 19 2018

Also the number of (0,1) square matrices up to row and column permutations with n ones and no zero rows or columns, with the same multiset of row sums as of column sums.

The weight of a multiset partition is the sum of sizes of its parts. Weight is generally not the same as number of vertices.

			Non-isomorphic representatives of the a(1) = 1 through a(6) = 12 set multipartitions:
  {1}  {1}{2}  {2}{12}    {12}{12}      {1}{23}{23}      {12}{13}{23}
               {1}{2}{3}  {1}{1}{23}    {2}{13}{23}      {3}{23}{123}
                          {1}{3}{23}    {3}{3}{123}      {1}{1}{1}{234}
                          {1}{2}{3}{4}  {1}{2}{2}{34}    {1}{1}{24}{34}
                                        {1}{2}{4}{34}    {1}{2}{34}{34}
                                        {1}{2}{3}{4}{5}  {1}{3}{24}{34}
                                                         {1}{4}{4}{234}
                                                         {2}{4}{12}{34}
                                                         {3}{4}{12}{34}
                                                         {1}{2}{3}{3}{45}
                                                         {1}{2}{3}{5}{45}
                                                         {1}{2}{3}{4}{5}{6}

Cf. A000700, A049311, A057151, A104602, A319056, A320451, A321719, A321721, A321723, A321732, A321734, A321735, A321736, A321854.

A326785 BII-numbers of uniform regular set-systems.

Original entry on oeis.org

0, 1, 2, 3, 4, 8, 9, 10, 11, 16, 32, 52, 64, 128, 129, 130, 131, 136, 137, 138, 139, 256, 288, 512, 528, 772, 816, 1024, 2048, 2052, 2320, 2340, 2580, 2592, 2868, 4096, 8192, 13376, 16384, 32768, 32769, 32770, 32771, 32776, 32777, 32778, 32779, 32896, 32897

Offset: 1

Gus Wiseman, Jul 25 2019

nonn

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every finite set of finite nonempty sets has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18. Elements of a set-system are sometimes called edges. A set-system is uniform if all edges have the same size, and regular if all vertices appear the same number of times.

			The sequence of all uniform regular set-systems together with their BII-numbers begins:
    0: {}
    1: {{1}}
    2: {{2}}
    3: {{1},{2}}
    4: {{1,2}}
    8: {{3}}
    9: {{1},{3}}
   10: {{2},{3}}
   11: {{1},{2},{3}}
   16: {{1,3}}
   32: {{2,3}}
   52: {{1,2},{1,3},{2,3}}
   64: {{1,2,3}}
  128: {{4}}
  129: {{1},{4}}
  130: {{2},{4}}
  131: {{1},{2},{4}}
  136: {{3},{4}}
  137: {{1},{3},{4}}
  138: {{2},{3},{4}}

Cf. A000120, A029931, A048793, A070939, A319056, A319189, A321698, A326031, A326701, A326783 (uniform), A326784 (regular), A326788.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[0,1000],SameQ@@Length/@bpe/@bpe[#]&&SameQ@@Length/@Split[Sort[Join@@bpe/@bpe[#]]]&]

Intersection of A326783 and A326784.

A321698 MM-numbers of uniform regular multiset multisystems. Numbers whose prime indices all have the same number of prime factors counted with multiplicity, and such that the product of the same prime indices is a power of a squarefree number.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 15, 16, 17, 19, 23, 25, 27, 29, 31, 32, 33, 41, 43, 47, 49, 51, 53, 55, 59, 64, 67, 73, 79, 81, 83, 85, 93, 97, 101, 103, 109, 113, 121, 123, 125, 127, 128, 131, 137, 139, 149, 151, 155, 157, 161, 163, 165, 167, 169, 177, 179

Offset: 1

Gus Wiseman, Dec 27 2018

nonn

A multiset multisystem is a finite multiset of finite multisets. 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. The multiset multisystem with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset multisystem with MM-number 78 is {{},{1},{1,2}}.

A multiset multisystem is uniform if all parts have the same size, and regular if all vertices appear the same number of times. For example, {{1,1},{2,3},{2,3}} is uniform and regular, so its MM-number 15463 belongs to the sequence.

			The sequence of all uniform regular multiset multisystems, together with their MM-numbers, begins:
   1: {}                   33: {{1},{3}}            109: {{10}}
   2: {{}}                 41: {{6}}                113: {{1,2,3}}
   3: {{1}}                43: {{1,4}}              121: {{3},{3}}
   4: {{},{}}              47: {{2,3}}              123: {{1},{6}}
   5: {{2}}                49: {{1,1},{1,1}}        125: {{2},{2},{2}}
   7: {{1,1}}              51: {{1},{4}}            127: {{11}}
   8: {{},{},{}}           53: {{1,1,1,1}}          128: {{},{},{},{},{},{}}
   9: {{1},{1}}            55: {{2},{3}}            131: {{1,1,1,1,1}}
  11: {{3}}                59: {{7}}                137: {{2,5}}
  13: {{1,2}}              64: {{},{},{},{},{},{}}  139: {{1,7}}
  15: {{1},{2}}            67: {{8}}                149: {{3,4}}
  16: {{},{},{},{}}        73: {{2,4}}              151: {{1,1,2,2}}
  17: {{4}}                79: {{1,5}}              155: {{2},{5}}
  19: {{1,1,1}}            81: {{1},{1},{1},{1}}    157: {{12}}
  23: {{2,2}}              83: {{9}}                161: {{1,1},{2,2}}
  25: {{2},{2}}            85: {{2},{4}}            163: {{1,8}}
  27: {{1},{1},{1}}        93: {{1},{5}}            165: {{1},{2},{3}}
  29: {{1,3}}              97: {{3,3}}              167: {{2,6}}
  31: {{5}}               101: {{1,6}}              169: {{1,2},{1,2}}
  32: {{},{},{},{},{}}    103: {{2,2,2}}            177: {{1},{7}}

Cf. A005176, A007016, A112798, A271103, A283877, A299353, A302242, A306017, A319056, A319189, A320324, A321699, A321717, A322554, A322703, A322833.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],And[SameQ@@PrimeOmega/@primeMS[#],SameQ@@Last/@FactorInteger[Times@@primeMS[#]]]&]

A321733 Number of (0,1)-matrices with n ones, no zero rows or columns, and the same row sums as column sums.

Original entry on oeis.org

1, 1, 2, 8, 40, 246, 1816, 15630, 153592, 1696760, 20816358, 280807868, 4131117440, 65823490088, 1129256780408

Offset: 0

Gus Wiseman, Nov 18 2018

			The a(4) = 40 matrices:
  [1 1]
  [1 1]
.
  [1 1 0][1 1 0][1 0 1][1 0 1][1 0 0]
  [1 0 0][0 0 1][1 0 0][0 1 0][0 1 1]
  [0 0 1][1 0 0][0 1 0][1 0 0][0 1 0]
.
  [1 0 0][0 1 1][0 1 0][0 1 0][0 1 0]
  [0 0 1][1 0 0][1 1 0][1 0 1][0 1 1]
  [0 1 1][1 0 0][0 0 1][0 1 0][1 0 0]
.
  [0 1 0][0 0 1][0 0 1][0 0 1][0 0 1]
  [0 0 1][1 1 0][1 0 0][0 1 0][0 0 1]
  [1 0 1][0 1 0][0 1 1][1 0 1][1 1 0]
.
  [1 0 0 0][1 0 0 0][1 0 0 0][1 0 0 0][1 0 0 0][1 0 0 0]
  [0 1 0 0][0 1 0 0][0 0 1 0][0 0 1 0][0 0 0 1][0 0 0 1]
  [0 0 1 0][0 0 0 1][0 1 0 0][0 0 0 1][0 1 0 0][0 0 1 0]
  [0 0 0 1][0 0 1 0][0 0 0 1][0 1 0 0][0 0 1 0][0 1 0 0]
.
  [0 1 0 0][0 1 0 0][0 1 0 0][0 1 0 0][0 1 0 0][0 1 0 0]
  [1 0 0 0][1 0 0 0][0 0 1 0][0 0 1 0][0 0 0 1][0 0 0 1]
  [0 0 1 0][0 0 0 1][1 0 0 0][0 0 0 1][1 0 0 0][0 0 1 0]
  [0 0 0 1][0 0 1 0][0 0 0 1][1 0 0 0][0 0 1 0][1 0 0 0]
.
  [0 0 1 0][0 0 1 0][0 0 1 0][0 0 1 0][0 0 1 0][0 0 1 0]
  [1 0 0 0][1 0 0 0][0 1 0 0][0 1 0 0][0 0 0 1][0 0 0 1]
  [0 1 0 0][0 0 0 1][1 0 0 0][0 0 0 1][1 0 0 0][0 1 0 0]
  [0 0 0 1][0 1 0 0][0 0 0 1][1 0 0 0][0 1 0 0][1 0 0 0]
.
  [0 0 0 1][0 0 0 1][0 0 0 1][0 0 0 1][0 0 0 1][0 0 0 1]
  [1 0 0 0][1 0 0 0][0 1 0 0][0 1 0 0][0 0 1 0][0 0 1 0]
  [0 1 0 0][0 0 1 0][1 0 0 0][0 0 1 0][1 0 0 0][0 1 0 0]
  [0 0 1 0][0 1 0 0][0 0 1 0][1 0 0 0][0 1 0 0][1 0 0 0]

Cf. A006052, A007016, A049311, A054976, A057151, A104602, A120732, A319056, A321717, A321723, A321732, A321735, A321736, A321739.

prs2mat[prs_]:=Table[Count[prs,{i,j}],{i,Union[First/@prs]},{j,Union[Last/@prs]}];
multsubs[set_,k_]:=If[k==0,{{}},Join@@Table[Prepend[#,set[[i]]]&/@multsubs[Drop[set,i-1],k-1],{i,Length[set]}]];
Table[Length[Select[Subsets[Tuples[Range[n],2],{n}],And[Union[First/@#]==Range[Max@@First/@#]==Union[Last/@#],Total/@prs2mat[#]==Total/@Transpose[prs2mat[#]]]&]],{n,5}]

a(7)-a(14) from Lars Blomberg, May 23 2019

A322529 Number of integer partitions of n whose parts all have the same number of prime factors (counted with or without multiplicity) and whose product of parts is a squarefree number.

Original entry on oeis.org

1, 1, 2, 2, 1, 3, 2, 3, 2, 2, 4, 2, 3, 3, 4, 4, 4, 3, 5, 4, 5, 6, 6, 6, 6, 6, 8, 6, 7, 9, 8, 11, 8, 11, 11, 11, 12, 13, 13, 15, 13, 17, 17, 18, 18, 17, 20, 22, 21, 24, 24, 24, 26, 29, 28, 33, 30, 35, 34, 38, 38, 45, 42, 43, 45, 48, 52, 54, 55, 59, 59, 65, 65, 72, 73

Offset: 0

Gus Wiseman, Dec 14 2018

nonn

Such a partition must be strict (unless it is all 1's) and its parts must also be squarefree.

			The a(30) = 8 integer partitions:
  (30),
  (17,13),(19,11),(23,7),
  (17,11,2),(23,5,2),
  (13,7,5,3,2),
  (1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1).

Lucas A. Brown, Table of n, a(n) for n = 0..133
Lucas A. Brown, Python program.

Cf. A002865, A003963, A005117, A038041, A064573, A073576, A302505, A319056, A320322, A321717, A321718, A322526, A322527, A322528, A322530, A322531.

Table[Length[Select[IntegerPartitions[n],And[SameQ@@PrimeOmega/@#,SquareFreeQ[Times@@#]]&]],{n,30}]

a(51)-a(69) from Jinyuan Wang, Jun 27 2020

a(70) onwards from Lucas A. Brown, Aug 17 2024

cp's OEIS Frontend

A321723 Number of non-normal magic squares whose entries are all 0 or 1 and sum to n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A321732 Number of nonnegative integer square matrices with sum of entries equal to n, no zero rows or columns, and the same row sums as column sums.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A322785 Number of uniform multiset partitions of uniform multisets of size n whose union is an initial interval of positive integers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

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.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A321736 Number of non-isomorphic weight-n multiset partitions whose part-sizes are also their vertex-degrees.

Views

Author

Keywords

Comments

Examples

Crossrefs

A321739 Number of non-isomorphic weight-n set multipartitions (multisets of sets) whose part-sizes are also their vertex-degrees.

Views

Author

Keywords

Comments

Examples

Crossrefs

A326785 BII-numbers of uniform regular set-systems.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A321698 MM-numbers of uniform regular multiset multisystems. Numbers whose prime indices all have the same number of prime factors counted with multiplicity, and such that the product of the same prime indices is a power of a squarefree number.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A321733 Number of (0,1)-matrices with n ones, no zero rows or columns, and the same row sums as column sums.

Views

Author