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

%I #10 Jul 18 2021 04:36:49

%S 1,1,1,4,2,3,10,6,28,12,45,23,36,18,114,72,652,47,39,61,3713,208,9655,

%T 965,11508,684,7085,1803

%N a(n) is the least k such that (10^k)*Mersenne-prime(n) + 1 is prime.

%C Primes certified using PFGW from Primeform group.

%e (10^1)*(2^5-1) + 1 = 10*31 + 1 = 311 is prime, 2^5-1 = Mersenne-prime(3) so a(3) = 1.

%t f[n_] := Module[{k = 1}, While[! PrimeQ[10^k*n + 1], k++]; k]; f /@ (2^MersennePrimeExponent[Range[15]]-1) (* _Amiram Eldar_, Jul 18 2021 *)

%Y Cf. A000043, A000668.

%K nonn,more

%O 1,4

%A _Pierre CAMI_, Feb 01 2005

%E a(23)-a(28) from _Amiram Eldar_, Jul 18 2021

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 18 11:29 EDT 2024. Contains 371779 sequences. (Running on oeis4.)