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.

Showing 1-10 of 12 results. Next

A006052 Number of magic squares of order n composed of the numbers from 1 to n^2, counted up to rotations and reflections.

Original entry on oeis.org

1, 0, 1, 880, 275305224, 17753889197660635632
Offset: 1

Views

Author

Keywords

Comments

a(4) computed by Frenicle de Bessy (1605? - 1675), published in 1693. The article mentions the 880 squares and considers also 5*5, 6*6, 8*8, and other squares. - Paul Curtz, Jul 13 and Aug 12 2011
a(5) computed by Richard C. Schroeppel in 1973.
According to Pinn and Wieczerkowski, a(6) = (0.17745 +- 0.00016) * 10^20. - R. K. Guy, May 01 2004
a(6) computed by Hidetoshi Mino in 2024 - Hidetoshi Mino, May 31 2024

Examples

			An illustration of the unique (up to rotations and reflections) magic square of order 3:
  +---+---+---+
  | 2 | 7 | 6 |
  +---+---+---+
  | 9 | 5 | 1 |
  +---+---+---+
  | 4 | 3 | 8 |
  +---+---+---+
		

References

  • E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Vol. II, pp. 778-783 gives the 880 4 X 4 squares.
  • M. Gardner, Mathematical Games, Sci. Amer. Vol. 249 (No. 1, 1976), p. 118.
  • M. Gardner, Time Travel and Other Mathematical Bewilderments. Freeman, NY, 1988, p. 216.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Extensions

Definition corrected by Max Alekseyev, Dec 25 2015
a(6) from Hidetoshi Mino, Jul 17 2023
Incorrect a(6) removed by Hidetoshi Mino, Sep 07 2023
a(6) from Hidetoshi Mino, May 31 2024

A321719 Number of non-normal semi-magic squares with sum of entries equal to n.

Original entry on oeis.org

1, 1, 3, 7, 28, 121, 746, 5041, 40608, 362936, 3635017, 39916801, 479206146, 6227020801, 87187426839, 1307674521272, 20923334906117, 355687428096001, 6402415241245577, 121645100408832001, 2432905938909013343, 51090942176372298027, 1124001180562929946213
Offset: 0

Views

Author

Gus Wiseman, Nov 18 2018

Keywords

Comments

A non-normal semi-magic square is a nonnegative integer matrix with row sums and column sums all equal to d, for some d|n.
Squares must be of size k X k where k is a divisor of n. This implies that a(p) = p! + 1 for p prime since the only allowable squares are of sizes 1 X 1 and p X p. The 1 X 1 square is [p], the p X p squares are necessarily permutation matrices and there are p! permutation matrices of size p X p. Also, a(n) >= n! + 1 for n > 1. - Chai Wah Wu, Jan 13 2019

Examples

			The a(3) = 7 semi-magic squares:
  [3]
.
  [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]
		

Crossrefs

Programs

  • Mathematica
    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/@#],SameQ@@Total/@prs2mat[#],SameQ@@Total/@Transpose[prs2mat[#]]]&]],{n,5}]

Formula

a(p) = p! + 1 for p prime and a(n) >= n! + 1 for n > 1 (see comment above). - Chai Wah Wu, Jan 13 2019
a(n) = Sum_{d|n} A257493(d, n/d) for n > 0. - Andrew Howroyd, Apr 11 2020

Extensions

a(7) from Chai Wah Wu, Jan 13 2019
a(6) corrected and a(8)-a(15) added by Chai Wah Wu, Jan 14 2019
a(16)-a(19) from Chai Wah Wu, Jan 16 2019
Terms a(20) and beyond from Andrew Howroyd, Apr 11 2020

A321717 Number of non-normal (0,1) semi-magic rectangles with sum of all entries equal to n.

Original entry on oeis.org

1, 1, 4, 8, 39, 122, 950, 5042, 45594, 366243, 3858148, 39916802, 494852628, 6227020802, 88543569808, 1308012219556, 21086562956045, 355687428096002, 6427672041650478, 121645100408832002, 2437655776358606198, 51091307191310604724, 1125098543553717372868, 25852016738884976640002, 620752122372339473623314, 15511210044577707470250243
Offset: 0

Views

Author

Gus Wiseman, Nov 18 2018

Keywords

Comments

A non-normal semi-magic rectangle is a nonnegative integer matrix with row sums and column sums all equal to d, for some d|n.
Rectangles must be of size k X m where k and m are divisors of n and k*m >= n. This implies that a(p) = p! + 2 for p prime since the only allowable rectangles are of sizes 1 X 1, 1 X p, p X 1 and p X p. There are no 1 X 1 rectangle that satisfies the condition. The 1 X p and p X 1 rectangles are [1....1] and its transpose, the p X p rectangle are necessarily permutation matrices and there are p! permutation matrices of size p X p. It also shows that a(n) >= n! + 2 for n > 1. - Chai Wah Wu, Jan 13 2019

Examples

			The a(3) = 8 semi-magic rectangles:
  [1 1 1]
.
  [1] [1 0 0] [1 0 0] [0 1 0] [0 1 0] [0 0 1] [0 0 1]
  [1] [0 1 0] [0 0 1] [1 0 0] [0 0 1] [1 0 0] [0 1 0]
  [1] [0 0 1] [0 1 0] [0 0 1] [1 0 0] [0 1 0] [1 0 0]
		

Crossrefs

Programs

  • Mathematica
    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/@#]==Range[Max@@Last/@#],SameQ@@Total/@prs2mat[#],SameQ@@Total/@Transpose[prs2mat[#]]]&]],{n,5}]

Formula

a(p) = p! + 2 for p prime. a(n) >= n! + 2 for n > 1. - Chai Wah Wu, Jan 13 2019

Extensions

a(7) from Chai Wah Wu, Jan 13 2019
a(8)-a(13) from Chai Wah Wu, Jan 14 2019
a(14)-a(15) from Chai Wah Wu, Jan 15 2019
a(16)-a(19) from Chai Wah Wu, Jan 16 2019
Terms a(20) onward from Max Alekseyev, Dec 04 2024

A321718 Number of coupled non-normal semi-magic rectangles with sum of entries equal to n.

Original entry on oeis.org

1, 1, 5, 9, 44, 123, 986, 5043, 45832, 366300, 3862429, 39916803, 495023832, 6227020803, 88549595295, 1308012377572, 21086922542349, 355687428096003, 6427700493998229, 121645100408832003, 2437658338007783347, 51091307195905020227, 1125098837523651728389, 25852016738884976640003, 620752163206546966698620, 15511210044577707492319496
Offset: 0

Views

Author

Gus Wiseman, Nov 18 2018

Keywords

Comments

A coupled non-normal semi-magic rectangle is a nonnegative integer matrix with equal row sums and equal column sums. The common row sum may be different from the common column sum.
Rectangles must be of size k X m where k and m are divisors of n. This implies that a(p) = p! + 3 for p prime since the only allowable rectangles are of sizes 1 X 1, 1 X p, p X 1 and p X p. The 1 X 1 square is [p], the 1 X p and p X 1 rectangles are [1,...,1] and its transpose and the p X p squares are necessarily permutation matrices and there are p! permutation matrices of size p X p. Also, a(n) >= n! + 3 for n > 1. - Chai Wah Wu, Jan 15 2019

Examples

			The a(3) = 9 coupled semi-magic rectangles:
  [3] [1 1 1]
.
  [1] [1 0 0] [1 0 0] [0 1 0] [0 1 0] [0 0 1] [0 0 1]
  [1] [0 1 0] [0 0 1] [1 0 0] [0 0 1] [1 0 0] [0 1 0]
  [1] [0 0 1] [0 1 0] [0 0 1] [1 0 0] [0 1 0] [1 0 0]
		

Crossrefs

Programs

  • Mathematica
    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/@#]==Range[Max@@Last/@#],SameQ@@Total/@prs2mat[#],SameQ@@Total/@Transpose[prs2mat[#]]]&]],{n,5}]

Formula

a(p) = p! + 3 for p prime. a(n) >= n! + 3 for n > 1. - Chai Wah Wu, Jan 15 2019

Extensions

a(7)-a(15) from Chai Wah Wu, Jan 15 2019
a(16)-a(19) from Chai Wah Wu, Jan 16 2019
Terms a(20) onward from Max Alekseyev, Dec 04 2024

A321721 Number of non-isomorphic non-normal semi-magic square multiset partitions of weight n.

Original entry on oeis.org

1, 1, 2, 2, 4, 2, 7, 2, 10, 7, 12, 2, 38, 2, 21, 46, 72, 2, 162, 2, 420, 415, 64, 2, 4987, 1858, 110, 9336, 45456, 2, 136018, 2, 1014658, 406578, 308, 3996977, 34937078, 2, 502, 28010167, 1530292965, 2, 508164038, 2, 54902992348, 51712929897, 1269, 2, 3217847072904, 8597641914, 9168720349613
Offset: 0

Views

Author

Gus Wiseman, Nov 18 2018

Keywords

Comments

A non-normal semi-magic square multiset partition of weight n is a multiset partition of weight n whose part sizes and vertex degrees are all equal to d, for some d|n.
The weight of a multiset partition is the sum of sizes of its parts. Weight is generally not the same as number of vertices.
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 row sums and column sums all equal to d, for some d|n.

Examples

			Non-isomorphic representatives of the a(2) = 2 through a(6) = 7 multiset partitions:
  {{11}}   {{111}}     {{1111}}       {{11111}}         {{111111}}
  {{1}{2}} {{1}{2}{3}} {{11}{22}}     {{1}{2}{3}{4}{5}} {{111}{222}}
                       {{12}{12}}                       {{112}{122}}
                       {{1}{2}{3}{4}}                   {{11}{22}{33}}
                                                        {{11}{23}{23}}
                                                        {{12}{13}{23}}
                                                        {{1}{2}{3}{4}{5}{6}}
Inequivalent representatives of the a(6) = 7 matrices:
  [6]
.
  [3 0] [2 1]
  [0 3] [1 2]
.
  [2 0 0] [2 0 0] [1 1 0]
  [0 2 0] [0 1 1] [1 0 1]
  [0 0 2] [0 1 1] [0 1 1]
.
  [1 0 0 0 0 0]
  [0 1 0 0 0 0]
  [0 0 1 0 0 0]
  [0 0 0 1 0 0]
  [0 0 0 0 1 0]
  [0 0 0 0 0 1]
Inequivalent representatives of the a(9) = 7 matrices:
  [9]
.
  [3 0 0] [3 0 0] [2 1 0] [2 1 0] [1 1 1]
  [0 3 0] [0 2 1] [1 1 1] [1 0 2] [1 1 1]
  [0 0 3] [0 1 2] [0 1 2] [0 2 1] [1 1 1]
.
  [1 0 0 0 0 0 0 0 0]
  [0 1 0 0 0 0 0 0 0]
  [0 0 1 0 0 0 0 0 0]
  [0 0 0 1 0 0 0 0 0]
  [0 0 0 0 1 0 0 0 0]
  [0 0 0 0 0 1 0 0 0]
  [0 0 0 0 0 0 1 0 0]
  [0 0 0 0 0 0 0 1 0]
  [0 0 0 0 0 0 0 0 1]
		

Crossrefs

Formula

a(p) = 2 for p prime corresponding to the 1 X 1 square [p] and the permutation matrices of size p X p with partition (1...10...0). - Chai Wah Wu, Jan 16 2019
a(n) = Sum_{d|n} A333733(d,n/d) for n > 0. - Andrew Howroyd, Apr 11 2020

Extensions

a(11)-a(13) from Chai Wah Wu, Jan 16 2019
a(14)-a(15) from Chai Wah Wu, Jan 20 2019
Terms a(16) and beyond from Andrew Howroyd, Apr 11 2020

A321722 Number of non-normal magic squares whose entries are nonnegative integers summing to n.

Original entry on oeis.org

1, 1, 1, 1, 10, 21, 97, 657, 5618, 48918, 494530, 5383553, 65112565, 840566081, 11834555867, 176621056393, 2838064404989, 48060623405313
Offset: 0

Views

Author

Gus Wiseman, Nov 18 2018

Keywords

Comments

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.

Examples

			The a(4) = 10 magic squares:
  [4]
.
  [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]
		

Crossrefs

Programs

  • Mathematica
    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/@#],SameQ@@Join[{Tr[prs2mat[#]],Tr[Reverse[prs2mat[#]]]},Total/@prs2mat[#],Total/@Transpose[prs2mat[#]]]]&]],{n,5}]

Formula

a(p) = A007016(p) + 1 if p is prime. a(n) >= A007016(n) + 1 for n > 1. - Chai Wah Wu, Jan 15 2019

Extensions

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

A321720 Number of non-normal (0,1) semi-magic squares with sum of entries equal to n.

Original entry on oeis.org

1, 1, 2, 6, 25, 120, 726, 5040, 40410, 362881, 3630840, 39916800, 479069574, 6227020800, 87181402140, 1307674370040, 20922977418841, 355687428096000, 6402388104196400, 121645100408832000, 2432903379962038320, 51090942171778378800, 1124000886592995642000, 25852016738884976640000
Offset: 0

Views

Author

Gus Wiseman, Nov 18 2018

Keywords

Comments

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

Crossrefs

Programs

  • Mathematica
    prs2mat[prs_]:=Table[Count[prs,{i,j}],{i,Union[First/@prs]},{j,Union[Last/@prs]}];
    Table[Length[Select[Subsets[Tuples[Range[n],2],{n}],And[Union[First/@#]==Union[Last/@#]==Range[Max@@First/@#],SameQ@@Total/@prs2mat[#],SameQ@@Total/@Transpose[prs2mat[#]]]&]],{n,5}]

Formula

a(p) = p! for p prime as the squares are all permutation matrices of order p and a(n) >= n! for n > 1 (see comments in A321717 and A321719). - Chai Wah Wu, Jan 13 2019
a(n) = Sum_{d|n, d<=n/d} A008300(n/d, d) for n > 0. - Andrew Howroyd, Apr 11 2020

Extensions

a(7) from Chai Wah Wu, Jan 13 2019
a(8)-a(15) from Chai Wah Wu, Jan 14 2019
a(16)-a(21) from Chai Wah Wu, Jan 16 2019
Terms a(22) and beyond from Andrew Howroyd, Apr 11 2020

A321724 Irregular triangle read by rows where T(n,k) is the number of non-isomorphic non-normal semi-magic square multiset partitions of weight n and length d = A027750(n, k).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 3, 5, 1, 1, 5, 1, 1, 3, 7, 1, 1, 1, 1, 4, 9, 12, 11, 1, 1, 1, 1, 4, 15, 1, 1, 13, 31, 1, 1, 5, 43, 22, 1, 1, 1, 1, 5, 22, 103, 30, 1, 1, 1, 1, 6, 106, 264, 42, 1, 1, 30, 383, 1, 1, 6, 56, 1, 1, 1, 1, 7, 45, 321, 2804, 1731, 77, 1
Offset: 1

Views

Author

Gus Wiseman, Nov 18 2018

Keywords

Comments

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 row sums and column sums all equal to d.
A non-normal semi-magic square multiset partition of weight n is a multiset partition of weight n whose part sizes and vertex degrees are all equal to d, for some d|n.
The weight of a multiset partition is the sum of sizes of its parts. Weight is generally not the same as number of vertices.

Examples

			Triangle begins:
  1
  1 1
  1 1
  1 2 1
  1 1
  1 2 3 1
  1 1
  1 3 5 1
  1 5 1
  1 3 7 1
Inequivalent representatives of the T(10,3) = 7 semi-magic squares (zeros not shown):
  [2    ] [2    ] [2    ] [2    ] [2    ] [11   ] [11   ]
  [ 2   ] [ 2   ] [ 2   ] [ 11  ] [ 11  ] [11   ] [1 1  ]
  [  2  ] [  2  ] [  11 ] [ 11  ] [ 1 1 ] [  11 ] [ 1 1 ]
  [   2 ] [   11] [  1 1] [   11] [  1 1] [  1 1] [  1 1]
  [    2] [   11] [   11] [   11] [   11] [   11] [   11]
		

Crossrefs

Formula

T(n,k) = A333733(d, n/d), where d = A027750(n, k). - Andrew Howroyd, Apr 11 2020

Extensions

a(28)-a(39) from Chai Wah Wu, Jan 16 2019
Terms a(40) and beyond from Andrew Howroyd, Apr 11 2020
Edited by Peter Munn, Mar 05 2025

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

Original entry on oeis.org

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

Views

Author

Gus Wiseman, Nov 18 2018

Keywords

Comments

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.

Examples

			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]
		

Crossrefs

Programs

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

Formula

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

Extensions

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

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

Views

Author

Gus Wiseman, Dec 27 2018

Keywords

Comments

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.

Examples

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

Crossrefs

Programs

  • Mathematica
    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[#]]]&]
Showing 1-10 of 12 results. Next