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 A063639 #20 Jun 28 2018 04:49:14
%S A063639 7,11,17,19,29,41,43,67,97,101,109,113,137,163,173,181,211,229,241,
%T A063639 257,281,283,317,331,337,353,373,401,409,433,523,547,577,601,617,641,
%U A063639 653,677,691,709,761,787,821,829,853,907,937,941,977,1009,1021,1033,1051
%N A063639 Primes of the form p*q*r - 1, where p, q and r are primes (not necessarily distinct).
%H A063639 Harry J. Smith, <a href="/A063639/b063639.txt">Table of n, a(n) for n = 1..1000</a>
%t A063639 Take[Select[Union[Times@@#-1&/@Tuples[Prime[Range[60]],3]],PrimeQ],60] (* _Harvey P. Dale_, Jan 23 2012 *)
%o A063639 (PARI) { n=0; for (m=1, 10^9, p=prime(m); if (bigomega(p + 1) == 3, write("b063639.txt", n++, " ", p); if (n==1000, break)) ) } \\ _Harry J. Smith_, Aug 26 2009
%o A063639 (Haskell)
%o A063639 a063639 n = a063639_list !! (n-1)
%o A063639 a063639_list = [p | p <- a000040_list, a001222 (p+1) == 3]
%o A063639 -- _Reinhard Zumkeller_, Feb 04 2012
%Y A063639 Cf. A014612, A063640.
%Y A063639 Cf. A000040, A001222.
%K A063639 nonn
%O A063639 1,1
%A A063639 _Reinhard Zumkeller_, Jul 21 2001