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!)
A051886 a(n) is the minimal prime p such that 2^n * p + 1 is prime. 6
2, 2, 3, 2, 7, 3, 3, 2, 3, 23, 13, 29, 3, 5, 7, 2, 37, 53, 3, 11, 7, 11, 37, 71, 73, 5, 7, 17, 13, 23, 3, 239, 43, 113, 163, 59, 3, 89, 349, 5, 97, 3, 73, 11, 67, 101, 19, 101, 61, 23, 7, 17, 7, 233, 127, 5, 541, 29, 103, 71, 31, 53, 109, 179, 163, 71, 3, 929, 31, 23, 193, 101 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
The minimal 2^n - Germain primes in order of increasing exponent n.
LINKS
EXAMPLE
The 10th term is 13, the first term in 1024-Germain prime sequence: {13,19,37,79,223,...}. The largest prime was found for 2^79: both 1427 and 604462909807314587353088*1427 + 1 = 862568572295037916152856577 are primes.
MATHEMATICA
Table[p = 2; While[! PrimeQ[2^n*p + 1], p = NextPrime@ p]; p, {n, 0, 71}] (* Michael De Vlieger, Mar 05 2017 *)
PROG
(PARI)
P=10^6;
default(primelimit, P);
a(n)={my(N=2^n); forprime(p=2, P, if(isprime(N*p+1), return(p))); }
vector(66, n, a(n))
/* Joerg Arndt, Jun 18 2012 */
CROSSREFS
Sequence in context: A256564 A092976 A084705 * A244080 A141652 A117754
KEYWORD
nonn
AUTHOR
Labos Elemer, Dec 15 1999
EXTENSIONS
Better name by Joerg Arndt, Jun 18 2012
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.)