This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A276496 #16 Sep 08 2022 08:46:17 %S A276496 1,2,5,6,10,11,60,75,1404,1974,16389,37105 %N A276496 a(n) is the least positive k such that A276495(n) + 2^k is prime. %C A276496 If A276495(13) = 453143, then a(13) > 10^5. %o A276496 (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; %Y A276496 Cf. A067760, A276495. %K A276496 nonn,hard,more %O A276496 1,2 %A A276496 _Arkadiusz Wesolowski_, Sep 05 2016 %E A276496 Typo in name corrected by _Rémy Sigrist_, Sep 12 2016