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!)
A102629 a(n) is the least k such that (10^k)*Mersenne-prime(n) + 1 is prime. 0
1, 1, 1, 4, 2, 3, 10, 6, 28, 12, 45, 23, 36, 18, 114, 72, 652, 47, 39, 61, 3713, 208, 9655, 965, 11508, 684, 7085, 1803 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
Primes certified using PFGW from Primeform group.
LINKS
EXAMPLE
(10^1)*(2^5-1) + 1 = 10*31 + 1 = 311 is prime, 2^5-1 = Mersenne-prime(3) so a(3) = 1.
MATHEMATICA
f[n_] := Module[{k = 1}, While[! PrimeQ[10^k*n + 1], k++]; k]; f /@ (2^MersennePrimeExponent[Range[15]]-1) (* Amiram Eldar, Jul 18 2021 *)
CROSSREFS
Sequence in context: A120240 A179394 A347265 * A082361 A082363 A026177
KEYWORD
nonn,more
AUTHOR
Pierre CAMI, Feb 01 2005
EXTENSIONS
a(23)-a(28) from Amiram Eldar, Jul 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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)