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.

A064103 Primes p = p(k) such that p(k) + p(k+9) = p(k+1) + p(k+8) = p(k+2) + p(k+7) = p(k+3) + p(k+6) = p(k+4) + p(k+5).

Original entry on oeis.org

13, 139, 6091, 19843, 51787, 55793, 113143, 179029, 205157, 302551, 346361, 460949, 895799, 970447, 1150651, 1180847, 1697257, 1929553, 2334781, 2580631, 2797447, 3056561, 3086009, 3416717, 3598943, 4024667, 4026107, 4067123, 4077583, 4389503, 4541083, 4790503
Offset: 1

Views

Author

Robert G. Wilson v, Sep 17 2001

Keywords

Examples

			13 + 47 = 17 + 43 = 19 + 41 = 23 + 37 = 29 + 31.
		

Crossrefs

Programs

  • Mathematica
    a = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; Do[ a = Delete[ a, 1 ]; a = Append[ a, Prime[ n ] ]; If[ a[ [ 1 ] ] + a[ [ 10 ] ] == a[ [ 2 ] ] + a[ [ 9 ] ] == a[ [ 3 ] ] + a[ [ 8 ] ] == a[ [ 4 ] ] + a[ [ 7 ] ] == a[ [ 5 ] ] + a[ [ 6 ] ], Print[ a[ [ 1 ] ] ] ], {n, 1, 3 10^5} ]

Formula

Primes p = prime(k) = A000040(k) such that A359440(k+4) >= 4. - Peter Munn, Jan 13 2023

Extensions

More terms from Sean A. Irvine, Jun 11 2023