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 A058911 #23 Dec 11 2022 15:23:49
%S A058911 0,1,2,3,6,9,462
%N A058911 Numbers k such that k^k + k + 1 is prime.
%C A058911 There is no further term up to 10000. - _Farideh Firoozbakht_, Nov 11 2006
%C A058911 If it exists, a(8) > 32100. - _Dmitry Petukhov_, Sep 14 2021
%e A058911 a(2) = 2 because 2^2 + 2 + 1 = 7.
%t A058911 Do[ If[ PrimeQ[ n^n + n + 1], Print[n]], {n, 1, 700} ]
%t A058911 Join[{0},Select[Range[470],PrimeQ[#^#+#+1]&]] (* _Harvey P. Dale_, Dec 11 2022 *)
%o A058911 (PARI) f2(n,k) = for(x=1,n,y=x^x+x+k;if(ispseudoprime(y),print1(x","))) \\ _Cino Hilliard_, Jan 07 2005
%o A058911 (PFGW) ABC2 $a^$a + $a + 1
%o A058911 a: from 0 to 1000 // _Jinyuan Wang_, Mar 01 2020
%Y A058911 Cf. A058912 (k^k + k - 1 is prime), A161471 (corresponding primes).
%K A058911 nonn,hard,more
%O A058911 1,3
%A A058911 _Felice Russo_, Jan 10 2001