|
|
A098567
|
|
Smallest prime p such that p# + Mersenne-prime(n) is prime.
|
|
1
|
|
|
2, 3, 3, 5, 5, 5, 7, 7, 31, 5, 59, 5, 11, 137, 397, 211, 2851, 601, 373, 271, 17467, 127, 1657, 52951, 6547, 11971, 37489
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MATHEMATICA
|
f[p_] := Module[{k = 2, q = 2}, While[!PrimeQ[k + p], q = NextPrime[q]; k *= q]; q]; f /@ (2^MersennePrimeExponent[Range[10]] - 1) (* Amiram Eldar, Jul 23 2021 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|