The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A092244 Numbers n such that 2^n-th prime + 2^(n-1)-th prime + 1 is prime. 0

%I

%S 11,73,443,1031,2339,11833,56737,122891,5423669

%N Numbers n such that 2^n-th prime + 2^(n-1)-th prime + 1 is prime.

%e prime(2^2)+prime(2^1) + 1 = 11 = prime.

%o (PARI) f(n)= for(x=1,n,y=prime(2^x)+ prime(2^(x-1))+1;if(isprime(y),print1(y",")))

%K hard,nonn

%O 1,1

%A _Cino Hilliard_, Feb 20 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 19 01:11 EST 2021. Contains 340262 sequences. (Running on oeis4.)