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 A049489 #32 Jan 04 2025 04:11:45
%S A049489 5,11,29,41,47,71,107,131,149,167,179,191,197,239,251,281,317,347,389,
%T A049489 401,431,467,491,509,569,587,599,641,659,677,701,719,797,821,827,887,
%U A049489 977,1019,1031,1061,1091,1097,1181,1217,1259,1289,1367,1427,1439,1451
%N A049489 Primes p such that p + 32 is also prime.
%H A049489 Karl V. Keller, Jr., <a href="/A049489/b049489.txt">Table of n, a(n) for n = 1..10000</a>
%e A049489 29 and 29 + 32 = 61 are both prime.
%p A049489 Primes:= select(isprime,{seq(i,i=3..10000,2)}):
%p A049489 sort(convert(Primes intersect map(`-`,Primes,32),list)); # _Robert Israel_, Dec 20 2015
%t A049489 Select[Range[2000], PrimeQ[#] && PrimeQ[# + 32] &] (* _Vincenzo Librandi_, Apr 22 2015 *)
%t A049489 Select[Prime[Range[300]],PrimeQ[#+32]&] (* _Harvey P. Dale_, Oct 14 2017 *)
%o A049489 (PARI) isok(n) = isprime(n) && isprime(n+32); \\ _Michel Marcus_, Dec 31 2013
%o A049489 (Magma) [p: p in PrimesUpTo(2000) | IsPrime(p+32)]; // _Vincenzo Librandi_, Apr 22 2015
%Y A049489 Cf. A001359, A023200, A023202, A049488.
%K A049489 nonn,easy
%O A049489 1,1
%A A049489 _Labos Elemer_
%E A049489 Name improved by _Bruno Berselli_, Apr 22 2015