login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182317 Least prime p = prime(k) such that prime(k+n) - prime(k) = 2^(n-1), or 0 if no such p exists. 1

%I #8 Apr 25 2012 12:15:20

%S 2,0,0,0,7,107,1117,23369,1050457,302728997

%N Least prime p = prime(k) such that prime(k+n) - prime(k) = 2^(n-1), or 0 if no such p exists.

%e a(1) = 2 = prime(1) = prime(1+1) - 2^(1-1) = 3-1,

%e a(5) = 7 = prime(4) = prime(4+5) - 2^(5-1) = 23-16,

%e a(6) = 107 = prime(28) = prime(28+6) - 2^(6-1) = 139-32,

%e a(7) = 1117 = prime(187) = prime(187+7) - 2^(7-1) = 1181-64,

%e a(8) = 23369 = prime(2605) = prime(2605+8) - 2^(8-1) = 23497-128.

%K nonn

%O 1,1

%A _Gerasimov Sergey_, Apr 24 2012

%E a(9) and a(10) from _T. D. Noe_, Apr 25 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 18 18:09 EDT 2024. Contains 376002 sequences. (Running on oeis4.)