login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Beginning with 2, smallest primes such that a(k)-a(k-1) is a distinct power of 2.
2

%I #10 Dec 25 2015 02:58:57

%S 2,3,5,13,17,8209,8273,10321,10337,10369,11393,34359749761,

%T 34359815297,34393369729,34460478593,34461002881,34461006977

%N Beginning with 2, smallest primes such that a(k)-a(k-1) is a distinct power of 2.

%C a(20) > 2^20000 if it exists. - _Robert Israel_, Dec 24 2015

%H Robert Israel, <a href="/A087356/b087356.txt">Table of n, a(n) for n = 0..19</a>

%e a(5) = 17, smallest prime of the form 17 + 2^r ( r >3) is r = 13 and a(6)= 8209, a(6) - a(5) = 8192 = 2^13.

%p A[0]:= 2:

%p P:= [seq(2^i,i=0..10000)]:

%p for n from 1 do

%p for i from 1 to nops(P) do

%p if isprime(A[n-1]+P[i]) then

%p A[n]:= A[n-1]+P[i];

%p P:= subsop(i=NULL,P);

%p break

%p fi

%p od;

%p if not assigned(A[n]) then break fi;

%p od:

%p seq(A[i],i=0..n-1); # _Robert Israel_, Dec 24 2015

%Y Cf. A087357.

%K nonn

%O 0,1

%A _Amarnath Murthy_, Sep 08 2003

%E More terms from _David Wasserman_, May 12 2005