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 A084047 #19 Jul 07 2024 13:44:18
%S A084047 2,3,11,5,37,7,268435463,6569,521,11,36028797018963979,13,
%T A084047 859935929762876868984659981,4807339234680508004200143948920808143,
%U A084047 32783,17,30491346729331195921,19,32064977213018365645815827,147808829414345923316083210206383297621
%N A084047 Smallest prime p such that p - n is an n-th power, or 0 if no such number exists; i.e., smallest prime of the form k^n + n.
%C A084047 A072883 is the main entry for the problem of finding the smallest prime of the form k^n + n: many such k (up to n = 750 and beyond) are listed in the b-file there, but the corresponding primes are too large to list more of them here. - _M. F. Hasler_, Jul 07 2024
%H A084047 Barry Carter, <a href="https://www.reddit.com/r/OEIS/comments/13bw3q4/tweaks_to_a084047_request">Tweaks to A084047 (request)</a>, in r/OEIS on reddit.com, May 8, 2023.
%F A084047 In general, if n+1 is prime, then a(n) = n + 1 = 1^n + n.
%F A084047 a(n) = A072883(n)^n + n if A072883(n) is not 0, otherwise 0. - _Michel Marcus_, Mar 27 2020
%e A084047 a(2) = 3 = 1^2 + 2; a(4) = 5 = 1^4 + 4; a(6) = 7 = 1^6 + 6.
%t A084047 f[n_] := f[n] = Module[{m=1}, While[!PrimeQ[m^n + n], m++]; Return[m^n + n]]; (* from _Barry Carter_ in r/OEIS, May 08 2023, cf. link. - _M. F. Hasler_, Jul 07 2024 *)
%o A084047 (PARI) A084047(n, k=A072883(n))=if(k, k^n + n, 0) \\ _M. F. Hasler_, Jul 07 2024
%Y A084047 Cf. A084046, A072883.
%K A084047 nonn,less
%O A084047 1,1
%A A084047 _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 26 2003
%E A084047 Corrected and extended by _Ray Chandler_, Jun 16 2003
%E A084047 One more term from _Michel Marcus_, Mar 27 2020