OFFSET
1,2
COMMENTS
There exist de Polignac numbers n such that for all k >= 1 the numbers n + 2^k are composite. It is conjectured that 30666137 is the smallest such number.
a(13) >= 453143.
PROG
(Magma) lst:=[]; c:=0; for n in [1..31951 by 2] do m:=-1; repeat m+:=1; a:=n-2^m; until a lt 1 or IsPrime(a); if a lt 1 then k:=0; repeat k+:=1; b:=n+2^k; until IsPrime(b); if k gt c then Append(~lst, n); c:=k; end if; end if; end for; lst;
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
Arkadiusz Wesolowski, Sep 05 2016
STATUS
approved