|
|
A244571
|
|
Smallest prime p >= prime(n) such that p*prime(n)-2 is prime.
|
|
5
|
|
|
3, 5, 7, 23, 13, 23, 19, 41, 29, 61, 37, 59, 43, 47, 71, 107, 61, 73, 71, 97, 109, 113, 89, 157, 113, 103, 107, 127, 167, 127, 131, 149, 139, 179, 163, 163, 181, 227, 173, 251, 199, 191, 223, 257, 229, 211, 223, 233, 271, 233, 239, 271, 281, 257, 443, 389, 373
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
a[n_] := For[p = Prime[n], True, p = NextPrime[p], If[PrimeQ[p Prime[n] - 2], Return[p]]];
|
|
PROG
|
(PARI) s=[]; for(n=2, 100, p=q=prime(n); while(!isprime(p*q-2), p=nextprime(p+1)); s=concat(s, p)); s \\ Colin Barker, Jun 30 2014
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|