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 A358079 #16 Nov 10 2022 07:44:14 %S A358079 11,37,67,4099,32771,262147,268435463,1073741827,36028797018963979, %T A358079 18889465931478580854821,151115727451828646838283, %U A358079 19342813113834066795298819,618970019642690137449562201,316912650057057350374175801351,85070591730234615865843651857942052871 %N A358079 Primes that can be written as 2^x + p where p is a prime and x is a multiple of p. %H A358079 Robert Israel, <a href="/A358079/b358079.txt">Table of n, a(n) for n = 1..32</a> %e A358079 a(3) = 67 is a term because 67 = 2^6 + 3 where 67 and 3 are prime and 6 is divisible by 3. %p A358079 R:= NULL: count:= 0: %p A358079 for k from 1 while count < 15 do %p A358079 P:= sort(convert(numtheory:-factorset(k),list)); %p A358079 for p in P do %p A358079 x:= 2^k+p; %p A358079 if isprime(x) then R:= R,x; count:= count+1; fi %p A358079 od od:R; %Y A358079 Contains A057664 and A228032. %Y A358079 Cf. A358087. %K A358079 nonn %O A358079 1,1 %A A358079 _J. M. Bergot_ and _Robert Israel_, Oct 30 2022