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 A064968 #9 Jun 19 2018 03:27:59
%S A064968 14965,16813,20767,23083,34270,40198,93238,112096,189802,192484,
%T A064968 251248,333946,334969,363514,374107,375127,376765,383473,405046,
%U A064968 419458,462928,498139,649948,703246,704374,732463,767101,781885,806467,812902,842428
%N A064968 Numbers k such that 1000000000k+1, 1000000000k+3, 1000000000k+7, 1000000000k+9 are all primes.
%H A064968 Harry J. Smith, <a href="/A064968/b064968.txt">Table of n, a(n) for n = 1..1000</a>
%t A064968 Select[Range[10^6], PrimeQ[10^9# + 1] && PrimeQ[10^9# + 3] && PrimeQ[10^9# + 7] && PrimeQ[10^9# + 9] &]
%o A064968 (PARI) { n=0; for (m=1, 10^9, b=10^9*m; if(isprime(b + 1) && isprime(b + 3) && isprime(b + 7) && isprime(b + 9), write("b064968.txt", n++, " ", m); if (n==1000, return)) ) } \\ _Harry J. Smith_, Oct 01 2009
%Y A064968 Cf. A007811, A064687.
%K A064968 nonn
%O A064968 1,1
%A A064968 _Robert G. Wilson v_, Oct 29 2001