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 A064652 #14 Apr 13 2016 00:38:48
%S A064652 2,3,2,3,2,5,3,3,2,3,2,5,3,3,2,7,2,11,3,3,2,3,5,5,3,5,2,3,2,11,7,3,5,
%T A064652 3,2,5,7,3,2,3,2,5,3,5,2,7,3,5,3,3,2,3,3,7,3,5,2,13,2,7,7,3,5,3,2,5,3,
%U A064652 3,2,13,2,5,3,3,7,7,2,5,43,3,2,3,5,13,3,5,2,3,3,7,19,5,11,3,2,5,3,3,2
%N A064652 Primes q associated with A064632.
%H A064652 Daria Micovic, <a href="/A064652/b064652.txt">Table of n, a(n) for n = 2..10000</a> [Terms 2-100 were computed by Robert G. Wilson v; terms 101-1155 were computed by Stephanie Anderson; terms 1156-10000 were computed by Daria Micovic]
%H A064652 Matthew M. Conroy, Journal of Integer Sequences, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL4/CONROY/conroy.html">A sequence related to a conjecture of Schinzel</a>
%e A064652 a(7) = 5 because (29-1)/(5-1).
%t A064652 NextPrim[n_] := (k = n + 1; While[ !PrimeQ[k], k++ ]; k); Do[p = 2; While[q = (p - 1)/n + 1; !PrimeQ[q] || q >= p, p = NextPrim[p]]; Print[q], {n, 2, 100} ]
%Y A064652 Cf. A064632, A064673.
%K A064652 easy,nonn
%O A064652 2,1
%A A064652 _Robert G. Wilson v_, Oct 16 2001