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 A187602 #25 Mar 02 2020 00:36:36
%S A187602 2,5,19,1301,262151,4782977
%N A187602 Primes of the form (k+1)^(k-1) + k.
%C A187602 The next terms are too large to be displayed:
%C A187602 a(7) = 159^157 + 158 (k = 158), which is 346 digits long.
%C A187602 a(8) = 537^535 + 536 (k = 536), which is 1461 digits long.
%C A187602 a(9) = 4671^4669 + 4670 (k = 4670), which is 17133 digits long.
%C A187602 a(10) = 9796^9794 + 9795 (k = 9795), which is 39089 digits long.
%C A187602 Next term has k >= 30000.
%e A187602 1301 is in the sequence since it is prime and, using k = 5, (k+1)^(k-1) + k = 6^4 + 5 = 1296 + 5 = 1301.
%t A187602 Do[p=(n+1)^(n-1)+n; If[PrimeQ[p], Print[p]], {n, 250}]
%o A187602 (PARI) lista(nn) = for(k=1, nn, if(ispseudoprime(q=(k+1)^(k-1)+k), print1(q, ", "))); \\ _Jinyuan Wang_, Mar 01 2020
%Y A187602 Cf. A238378 (corresponding k).
%K A187602 nonn,hard
%O A187602 1,1
%A A187602 _Marco Ripà_, Mar 11 2011
%E A187602 a(8)-a(10) from _Matevz Markovic_, Mar 03 2014