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 A062252 #17 Jan 26 2019 14:28:42 %S A062252 2,3,5,7,13,19,23,41,71,109,179,239,269,347,353,443,503,509,617,641, %T A062252 701,773,881,971,977,1013,1019,1103,1109,1223,1559,1607,1709,1889, %U A062252 2063,2297,2663,2963,3137 %N A062252 Record-setting values of q(n), the minimal prime q such that n(q+1)-1 is a prime p (i.e., q(n) > q(j) for all 0 < j < n). %H A062252 Matthew M. Conroy, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL4/CONROY/conroy.html">A sequence related to a conjecture of Schinzel</a>, J. Integ. Seqs. Vol. 4 (2001), #01.1.7. %e A062252 31 = (433+1)/(13+1). %Y A062252 Cf. A060324, A062251. Values of n are in A060424, values of p in A062256. %K A062252 nonn,nice,more %O A062252 1,1 %A A062252 _N. J. A. Sloane_, Jul 01 2001 %E A062252 a(36)-a(39) from _Amiram Eldar_, Jan 26 2019