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

A276496
a(n) is the least positive k such that A276495(n) + 2^k is prime.
1
1, 2, 5, 6, 10, 11, 60, 75, 1404, 1974, 16389, 37105
OFFSET
1,2
COMMENTS
If A276495(13) = 453143, then a(13) > 10^5.
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, k); c:=k; end if; end if; end for; lst;
CROSSREFS
Sequence in context: A238096 A064572 A032399 * A007969 A187902 A187231
KEYWORD
nonn,hard,more
AUTHOR
EXTENSIONS
Typo in name corrected by Rémy Sigrist, Sep 12 2016
STATUS
approved