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 A255598 #9 Feb 27 2015 23:28:46
%S A255598 2,2,3,2,3,2,5,2,5,2,3,3,7,2,3,2,3,2,5,2,3,4,5,2,5,3,3,2,5,2,13,3,3,2,
%T A255598 3,2,11,2,5,4,3,3,5,2,3,2,5,3,5,2,9,5,3,4,7,2,3,2,5,2,7,6,3,2,5,2,5,3,
%U A255598 11,4,3,4,13,5,5,2,3,2,7,2,7,4,3,2,5,2,3,2,15,2,7,3,5,2,3,3,11
%N A255598 a(n) is the minimal number q>1 such that n(q+1)-1 is prime, or -1 if no such q exists.
%C A255598 a(n) <= A060324(n), and a(n) = A060324(n) iff a(n) is prime.
%C A255598 Among first 10000 terms, in 2453 cases a(n) < A060324(n). First such cases are for n = 22, 40, 51, 54, 62, 70, 72, 82, 89, 100.
%C A255598 Also, among first 10^6 terms, in 324388 cases a(n) < A060324(n).
%o A255598 (PARI) a(n) = {my(q = 2); while (! isprime(n*(q+1)-1), q ++); q;} \\ _Michel Marcus_, Feb 27 2015
%Y A255598 Cf. A060324.
%K A255598 nonn
%O A255598 1,1
%A A255598 _Zak Seidov_, Feb 27 2015