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 A220951 #24 Sep 08 2022 08:46:04 %S A220951 5,7,11,13,31,61,251,4093 %N A220951 Primes p such that p+6 is also prime and there is a power of two in the interval (p,p+6). %C A220951 A search for sexy primes bracketing a power of two was conducted up to 2^1500. It is conjectured that this is a finite sequence. %C A220951 On the basis of existing work about primes of the form 2^n+k and 2^n-k, plus a few additional tests, we have a(9) > 2^750740. - _Giovanni Resta_, Feb 21 2013 %t A220951 pptQ[n_]:=AllTrue[{n,n+6},PrimeQ]&&Count[Log[2,#]&/@Range[n,n+6], _?IntegerQ] > 0; Select[Range[4100],pptQ] (* The program uses the AllTrue function from Mathematica version 10 *) (* _Harvey P. Dale_, Nov 01 2015 *) %o A220951 (Magma) %o A220951 //Program finds primes separated by an even number (called gap) which have a power of two between them. Program starts with the smallest power of two above gap. Primes less than this starting point can be checked by inspection. %o A220951 gap:=6; %o A220951 start:=Ilog2(gap)+1; %o A220951 for i:= start to 1000 do %o A220951 powerof2:=2^i; %o A220951 for k:=powerof2-gap+1 to powerof2-1 by 2 do %o A220951 if (IsPrime(k) and IsPrime(k+gap)) then %o A220951 k; %o A220951 end if; %o A220951 end for; %o A220951 end for; %Y A220951 Cf. A023201, A220746, A221211. %K A220951 nonn,more %O A220951 1,1 %A A220951 _Brad Clardy_, Feb 20 2013