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.

A140555 Primes p such that p + 6 is not a prime.

Original entry on oeis.org

2, 3, 19, 29, 43, 59, 71, 79, 89, 109, 113, 127, 137, 139, 149, 163, 179, 181, 197, 199, 211, 229, 239, 241, 269, 281, 283, 293, 313, 317, 337, 349, 359, 379, 389, 397, 401, 409, 419, 421, 431, 439, 449, 463, 467, 479, 487, 491, 499, 509, 521, 523, 547, 569
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Jul 03 2008

Keywords

Comments

Note that if Goldbach's Conjecture (2n = p1 + p2 for all n>=2) is false and K is the smallest value of n for which it fails, then for 2(K-3) = p3 + p4, the primes p3 and p4 must be taken from this list. See also A067775. - Keith Backman, Apr 05 2012

Crossrefs

Programs

  • Mathematica
    Select[Prime[Range[200]],!PrimeQ[#+6]&] (* Harvey P. Dale, Dec 21 2016 *)
  • PARI
    forprime(p=2,600,if(!isprime(p+6),print1(p,","))) \\ Klaus Brockhaus, Aug 12 2008

Formula

A000040 SET MINUS A023201. - R. J. Mathar, Aug 09 2008

Extensions

Corrected by R. J. Mathar and Klaus Brockhaus, Aug 12 2008