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 A099227 #22 Aug 08 2023 14:47:44
%S A099227 11,37,67,83,227,443,521,1091,1523,2027,3251,4099,6563,6569,9803,
%T A099227 10651,11027,12323,13691,15131,17579,21611,29243,32771,32783,47963,
%U A099227 50627,56171,59051,62003,65027,74531,88211,91811,95483,103043,119027,123203
%N A099227 Primes of the form m^k+k, with m and k > 1.
%C A099227 It appears that primes of this form are much less common than primes of the form m^k-k (A099228).
%C A099227 As N increases, squares <= N outnumber all higher powers <= N by an increasingly wide margin, so the above observation is increasingly a consequence of the fact that primes of the form m^2 + 2 are less common than primes of the form m^2 - 2. Among numbers of these two forms, multiples of 3 make up 2/3 of the former, but none of the latter. - _Jon E. Schoenfield_, Jun 05 2021
%H A099227 Vincenzo Librandi and Charles R Greathouse IV, <a href="/A099227/b099227.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Librandi)
%t A099227 nLim=200000; lst={}; Do[k=2; While[n=m^k+k; n<=nLim, AppendTo[lst, n]; k++ ], {m, 2, Sqrt[nLim]}]; Select[Union[lst], PrimeQ]
%o A099227 (PARI) list(lim)=my(v=List()); for(e=2,logint(lim\=1,2), forstep(n=3-e%2,sqrtnint(lim-e,e),2, my(t=n^e+e); if(isprime(t), listput(v,t)))); Set(v) \\ _Charles R Greathouse IV_, Jun 23 2023
%Y A099227 Cf. A099225 (numbers of the form m^k+k, with m and k > 1), A093324 (least k such that n^k+k is prime).
%Y A099227 Cf. A099228.
%K A099227 nonn
%O A099227 1,1
%A A099227 _T. D. Noe_, Oct 06 2004