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”).

A276495
Odd numbers not of the form p + 2^m with p prime and m >= 0 for which the smallest k in A067760 such that n + 2^k is prime increases.
1
1, 127, 251, 1657, 1777, 1973, 3181, 21893, 31951, 50839, 67607, 138977
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
A276496 gives the record values.
Sequence in context: A142491 A142551 A048453 * A196657 A138127 A157949
KEYWORD
nonn,hard,more
AUTHOR
STATUS
approved