Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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!)
A342692 a(n) is the smallest prime p which is greater than the exponent of the n-th Mersenne prime. 0
3, 5, 7, 11, 17, 19, 23, 37, 67, 97, 109, 131, 523, 613, 1283, 2207, 2287, 3221, 4259, 4441, 9697, 9949, 11239, 19949, 21713, 23227, 44501, 86249, 110527, 132059, 216103, 756853, 859447, 1257827, 1398281, 2976229, 3021407, 6972607, 13466923, 20996023 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Eric Weisstein's World of Mathematics, Mersenne Prime
Wikipedia, Mersenne Prime
FORMULA
a(n) = A151800(A000043(n)).
EXAMPLE
Terms begin as follows:
. a(n) =
n n-th Mersenne prime exponent q nextprime(q)
- --------------------- ---------- ------------
1 2^2 - 1 = 3 2 3
2 2^3 - 1 = 7 3 5
3 2^5 - 1 = 31 5 7
4 2^7 - 1 = 127 7 11
5 2^13 - 1 = 8191 13 17
6 2^17 - 1 = 131071 17 19
7 2^19 - 1 = 524287 19 23
8 2^31 - 1 = 2147483647 31 37
MATHEMATICA
Table[NextPrime[MersennePrimeExponent[n]], {n, 1, 47}]
CROSSREFS
Cf. A000043 (Mersenne prime exponents), A000668 (Mersenne primes), A151800 (next prime).
Sequence in context: A128926 A139559 A158361 * A048184 A290283 A163420
KEYWORD
hard,less,nonn
AUTHOR
David R. Kirkby, May 18 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 September 11 23:02 EDT 2024. Contains 375842 sequences. (Running on oeis4.)