OFFSET
1,1
COMMENTS
This sequence is a variation of the sequence in the reference. However, this sequence should have an infinite number of terms. k=2 in the PARI code.
REFERENCES
R. Crandall and C. Pomerance, Prime Numbers A Computational Perspective, Springer Verlag 2002, p. 49, exercise 1.18.
EXAMPLE
31*3 = 93 which is two away from 91 and 95 both not prime.
MATHEMATICA
Select[Prime@Range@200, !PrimeQ[3#-2]&&!PrimeQ[3#+2]&] (* Vladimir Joseph Stephan Orlovsky, Apr 25 2011 *)
Select[Prime[Range[200]], NoneTrue[3#+{2, -2}, PrimeQ]&] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Feb 01 2019 *)
PROG
(PARI) primepm3(n, k) = =number of iterations, k = factor { local(x, p1, p2, f1, f2, r); if(k%2, r=2, r=1); for(x=1, n, p1=prime(x); p2=prime(x+1); if(!isprime(p1*k+r)&!isprime(p1*k-r), print1(p1", ") ) ) }
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Cino Hilliard, Aug 17 2006
STATUS
approved