|
|
A092244
|
|
Numbers n such that 2^n-th prime + 2^(n-1)-th prime + 1 is prime.
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
prime(2^2)+prime(2^1) + 1 = 11 = prime.
|
|
PROG
|
(PARI) f(n)= for(x=1, n, y=prime(2^x)+ prime(2^(x-1))+1; if(isprime(y), print1(y", ")))
|
|
CROSSREFS
|
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|