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-5 of 5 results.

A073473 Primes (including 1) forming 3 X 3 magic square with prime entries and minimal constant 111 = A073502(3).

Original entry on oeis.org

1, 7, 13, 31, 37, 43, 61, 67, 73
Offset: 1

Views

Author

Lee Sallows (Sallows(AT)psych.kun.nl), Aug 27 2002

Keywords

Comments

Until the early part of the twentieth century 1 was regarded as a prime (cf. A008578).
"The problem of constructing magic squares with prime numbers only was first discussed by myself in The Weekly Dispatch for Jul 22 1900 and Aug 05 1900; but during the last three or four years it has received great attention from American mathematicians. First, they have sought to form these squares with the smallest possible constants.
"Thus the first nine prime numbers, 1 to 23 inclusive, sum to 99, which (being divisible by 3) is theoretically a suitable series; yet it has been demonstrated that the smallest possible constant is 111 and the required series as follows: 1,7,13,31,37,43,61,67,73." - Dudeney
See A024351 for the "modern" version of the minimal 3 X 3 magic square of primes. - M. F. Hasler, Oct 30 2018

Examples

			The square is [ 43 1 67 / 61 37 13 / 7 73 31 ].
		

References

  • H. E. Dudeney, Amusements in Mathematics, Nelson, London, 1917, page 125.

Crossrefs

A024351 Primes forming a 3 X 3 magic square with prime entries and minimal constant 177 = A164843(3).

Original entry on oeis.org

5, 17, 29, 47, 59, 71, 89, 101, 113
Offset: 1

Views

Author

Karl Schmerbauch (karl.j.schmerbauch(AT)boeing.com)

Keywords

Comments

The minimal 3 X 3 magic square made of consecutive primes has constant 4440084513 = A073520(3) = A270305(1), cf. A073519. - M. F. Hasler, Oct 22 2018
Sequence A073473 gives a variant using "primes including 1" (for historical reasons), to which also refers A073502. - M. F. Hasler, Oct 24 2018

Examples

			The square is [101 5 71 ; 29 59 89 ; 47 113 17].
The lexicographically smallest equivalent variant (modulo reflections on the symmetry axes of the square) is [17 89 71 ; 113 59 5 ; 47 29 101], cf. A320872. - _M. F. Hasler_, Oct 24 2018
		

Crossrefs

Cf. A320872 (3 X 3 magic squares of primes), A268790 (magic sums of these).

Programs

  • PARI
    A024351=select(p->setsearch(P,118-p),P=primes(30)[^5]) \\ 118 = 2*59, where 59 is the central prime; primes(30) = primes < 118. For the magic square itself, use A320872_row(1). -  M. F. Hasler, Oct 25 2018

Extensions

Offset corrected by Arkadiusz Wesolowski, Nov 26 2011

A164843 The smallest magic constant of an n X n magic square with distinct prime entries.

Original entry on oeis.org

177, 120, 233, 432, 733, 1154, 1731, 2470, 3417, 4584, 6013, 7712, 9731, 12088, 14807, 17940, 21501, 25530, 30021, 35086, 40675, 46840, 53631, 61092, 69251, 78100, 87697, 98084, 109309, 121380, 134377, 148258, 163043
Offset: 3

Views

Author

Andrew Lelechenko, Aug 28 2009 and Natalia Makarova, Sep 08 2009

Keywords

Comments

a(n) >= m(n), where m(n) is the smallest integer of the same parity as n, which is >= (Sum_{k=1..n^2} prime(k+1))/n. For example, Sum_{k=1..5^2} prime(k+1)/5=231.8, so m(5)=233. Conjecture: for n > 4, a(n)=m(n) or a(n)=m(n)+2.

Examples

			From _Natalia Makarova_, Sep 26 2009: (Start)
Here is a 14 X 14 example:
  [  3   43   59  131  181  271  383  599  797  919  971 1039 1123 1193
  1151  433  967  211  337  491  397  691   83  523  593  773  449  613
   263  373  101 1063  877  617  419  911  787  241  151  839  739  331
   503  439  809 1051 1091  659  157 1031   71  139  379  179  743  461
   173  647 1069  389 1049   19  311  223  317 1103  283  947  499  683
   547   13 1061  353  229  853  677  751  571  983 1201   29  193  251
   643  269  887  733   23  409 1129  191  769  401   47 1109  149  953
   163  881  673  107  431  487  991  631  829  109  349  367  811  883
  1163  827  607 1171  443  653  463    5  457  577   31  293  601  421
   509 1097  313  757  167  709  761  347  857  137  619  233   89 1117
  1093 1019    7  521 1033   61   73  941 1009  859  701   11  127  257
    53  467   97  307 1153  557 1021  569  359  937  821  113  977  281
   907   17  823  641  661  929   67  719   79  587  479  563 1013  227
   541 1187  239  277   37  997  863  103  727  197 1087 1217  199   41 ]
(End)
Comment from _N. J. A. Sloane_, Sep 28 2009: this contains 192 consecutive primes, 3 to 1171, plus 1187, 1193, 1201, 1217.
For the 3 X 3 case see A024351. For the 4 X 4 magic square see the Mathworld link.
		

Crossrefs

Extensions

Partially reworded by R. J. Mathar, Aug 31 2009
Edited by N. J. A. Sloane, Sep 14 2009
a(11)-a(15) from Natalia Makarova, a(16)-a(35) from Natalia Makarova and Stefano Tognon
Edited by Max Alekseyev, Feb 11 2010

A173079 Positive integers n such that the sum S of 1 and first n^2-1 odd primes is divisible by n and S/n == n (mod 2).

Original entry on oeis.org

1, 2, 3, 12, 15, 17, 22, 35, 124, 191, 774, 1405, 1522, 3988, 6220, 7448, 8038, 11404, 63027, 161153, 582096
Offset: 1

Views

Author

Max Alekseyev, Feb 09 2010

Keywords

Comments

A necessary condition for the existence of n X n magic square consisting of 1 and the first n^2-1 odd primes.
In 1913, J. N. Muncey proved that 12 is actually the smallest (nontrivial) order for which such a magic square exists.
Squares of order 15, 17, 22, 35 and 124 were constructed by S. Tognon.
From A.H.M. Smeets, Mar 10 2021: (Start)
The number S/n, if it exists, is also called the potential magic constant.
It is believed that the corresponding magic squares do exist for any order a(n) with n >= 4. (End)
No other terms below 3*10^6. - Max Alekseyev, Nov 07 2024

Examples

			From _A.H.M. Smeets_, Mar 10 2021: (Start)
The case a(1) = 1 is trivial.
In case a(2) = 2, the set of potential magic square numbers is {1, 3, 5, 7} with potential magic constant 8, however, no magic square exists of order 2.
In case a(4) = 12, not only the potential magic constant exists, but also the magic square itself, as shown by Stefano Tognon or Eric Weisstein's World of Mathematics. (End)
		

Crossrefs

Extensions

a(20) from Donovan Johnson, Nov 30 2010
a(1)=1 prepended by A.H.M. Smeets, Mar 10 2021
a(21) from Max Alekseyev, Nov 01 2024

A364538 A 12 X 12 magic square composed of 1 and the first consecutive odd primes with the smallest possible magic sum, read by rows.

Original entry on oeis.org

1, 823, 821, 809, 811, 797, 19, 29, 313, 31, 23, 37, 89, 83, 211, 79, 641, 631, 619, 709, 617, 53, 43, 739, 97, 227, 103, 107, 193, 557, 719, 727, 607, 139, 757, 281, 223, 653, 499, 197, 109, 113, 563, 479, 173, 761, 587, 157, 367, 379, 521, 383, 241, 467, 257, 263, 269, 167, 601, 599
Offset: 1

Views

Author

Paolo Xausa, Jul 28 2023

Keywords

Comments

This magic square was discovered in 1913 by J. N. Muncey.
12 is the smallest order possible for a nontrival magic square of this type. The magic sum is 4514.

Examples

			The magic square is:
  [   1 823 821 809 811 797  19  29 313  31  23  37 ]
  [  89  83 211  79 641 631 619 709 617  53  43 739 ]
  [  97 227 103 107 193 557 719 727 607 139 757 281 ]
  [ 223 653 499 197 109 113 563 479 173 761 587 157 ]
  [ 367 379 521 383 241 467 257 263 269 167 601 599 ]
  [ 349 359 353 647 389 331 317 311 409 307 293 449 ]
  [ 503 523 233 337 547 397 421  17 401 271 431 433 ]
  [ 229 491 373 487 461 251 443 463 137 439 457 283 ]
  [ 509 199  73 541 347 191 181 569 577 571 163 593 ]
  [ 661 101 643 239 691 701 127 131 179 613 277 151 ]
  [ 659 673 677 683  71  67  61  47  59 743 733  41 ]
  [ 827   3   7   5  13  11 787 769 773 419 149 751 ]
		

References

  • Martin Gardner, The Sixth Book of Mathematical Games from Scientific American, Chicago, IL, University of Chicago Press, 1984, pp. 86-87.

Crossrefs

Showing 1-5 of 5 results.