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 A062256 #21 Jan 26 2019 14:28:51 %S A062256 2,11,41,103,433,1019,2423,6131,22391,146519,398339,1461359,2803139, %T A062256 3943883,11329061,37133051,72486287,89857919,152222051,247964153, %U A062256 316352087,927830951,2030767073,5359478723,8908239161,11980112897,17219108579,20740431791,27651446429 %N A062256 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 A062256 Amiram Eldar, <a href="/A062256/b062256.txt">Table of n, a(n) for n = 1..39</a> %H A062256 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. %F A062256 a(n) = A060424(n)*(A062252(n)+1) - 1. %e A062256 31 = (433+1)/(13+1). %Y A062256 Cf. A060324, A062251. Values of n are in A060424, values of q in A062252. %K A062256 nonn,nice %O A062256 1,1 %A A062256 _N. J. A. Sloane_, Jul 01 2001 %E A062256 More terms from _Vladeta Jovovic_, Jul 02 2001