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 A062284 #23 Sep 08 2022 08:45:03
%S A062284 3,11,17,23,29,47,53,59,89,101,107,113,131,149,173,179,191,227,233,
%T A062284 257,263,281,317,347,359,383,389,449,491,521,557,563,569,593,641,659,
%U A062284 677,683,701,719,761,773,809,827,857,887,941,947,971,983,1013,1019,1103
%N A062284 Primes p such that p + 50 is also prime.
%C A062284 "Numerical evidence makes it plausible that there are infinitely many primes p such that p + 50 is also prime", see Burton in References.
%D A062284 D. M. Burton, Elementary Number Theory, Allyn and Bacon, Inc., Boston, MA, 1976, p. 52.
%H A062284 Harry J. Smith, <a href="/A062284/b062284.txt">Table of n, a(n) for n = 1..1000</a>
%e A062284 a(3)=17 since 17+50= 67, a prime.
%t A062284 Select[Range[2000], PrimeQ[#] && PrimeQ[# + 50] &] (* _Vincenzo Librandi_, Apr 22 2015 *)
%t A062284 Select[Prime[Range[200]],PrimeQ[#+50]&] (* _Harvey P. Dale_, Jun 17 2020 *)
%o A062284 (PARI) for(n=1,60, if(isprime(prime(n)+50),print(prime(n))))
%o A062284 (PARI) { n=0; forprime (p=2, 10^5, if (isprime(p + 50), write("b062284.txt", n++, " ", p); if (n==1000, break)) ) } \\ _Harry J. Smith_, Aug 04 2009
%o A062284 (Magma) [p: p in PrimesUpTo(2000) | IsPrime(p+50)]; // _Vincenzo Librandi_, Apr 22 2015
%Y A062284 Cf. A062288.
%K A062284 nonn,easy
%O A062284 1,1
%A A062284 _Jason Earls_, Jul 02 2001
%E A062284 More terms from Larry Reeves (larryr(AT)acm.org), Jul 05 2001