login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
Sequence in context: A076367 A362840 A302607 * A086162 A036703 A306253
KEYWORD
nonn,more
AUTHOR
Pierre CAMI, Sep 15 2004
EXTENSIONS
a(21)-a(27) from Amiram Eldar, Jul 23 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 05:56 EDT 2024. Contains 371906 sequences. (Running on oeis4.)