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 A244916 #27 May 31 2025 19:54:45
%S A244916 3,31,71,97,107,277,307,641,907,967,1009,1447,3463,3527,7757,8167,
%T A244916 250867,279047,1107791,1176671,1538399,1594909,2450017
%N A244916 Primes prime(k) such that 2^(k+1) + prime(k) is also prime.
%p A244916 for i from 1 do
%p A244916 p := ithprime(i) ;
%p A244916 if isprime(p+2^(i+1)) then
%p A244916 printf("%d,\n",p) ;
%p A244916 end if;
%p A244916 end do: # _R. J. Mathar_, Jul 12 2014
%t A244916 p = 2; lst = {}; While[p < 900000, If[ PrimeQ[ 2^(PrimePi@ p +1) + p], AppendTo[lst, p]; Print@ p]; p = NextPrime@ p]; lst
%o A244916 (PARI) lista(nn) = {ip = 1; forprime(p=2, nn, if (isprime(2^(ip+1)+p), print1(p, ", ")); ip++;);} \\ _Michel Marcus_, Jul 12 2014
%Y A244916 Cf. A078686, A242944, A227126, A228021.
%K A244916 nonn,more,hard
%O A244916 1,1
%A A244916 _Robert G. Wilson v_, Jul 09 2014
%E A244916 a(19)-a(23) from _Michael S. Branicky_, May 31 2025