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 A238378 #28 Feb 07 2024 17:55:30 %S A238378 1,2,3,5,7,8,158,536,4670,9795 %N A238378 Numbers k such that (k+1)^(k-1) + k is prime. %C A238378 Next term is >= 30000. %e A238378 3 is in the sequence since (3+1)^(3-1) + 3 = 4^2 + 3 = 19 is prime. %t A238378 Select[Range[600],PrimeQ[(#+1)^(#-1)+#]&] (* The program generates the first eight terms of the sequence. *) (* _Harvey P. Dale_, Feb 07 2024 *) %o A238378 (PARI) is(n)=isprime((n+1)^(n-1)+n) \\ _Charles R Greathouse IV_, Jun 06 2017 %Y A238378 Cf. A187602 (corresponding primes). %K A238378 nonn,hard,more %O A238378 1,2 %A A238378 _Matevz Markovic_, Feb 25 2014