OFFSET
2,1
COMMENTS
These numbers are useful as Diffie-Hellman moduli.
LINKS
Mersenne Forum, CRUS-like sieving challenge
EXAMPLE
a(2)=5 because 2^(2^2) - 5 = 11 is the largest safe prime less than 16.
PROG
(PARI) a(n) = {k = 1; pow2 = 2^(2^n); while (! (isprime(pow2 - k) && isprime((pow2 - k - 1)/2)), k +=2; ); k; } \\ Michel Marcus, Aug 16 2013
CROSSREFS
KEYWORD
nonn,more,hard
AUTHOR
Ken Takusagawa, Jan 27 2011
EXTENSIONS
a(14) from Ken Takusagawa, May 31 2011
a(15) from Gary Barnes, Oct 26 2011
a(16) from Mark Andreas, Jan 23 2023
STATUS
approved