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 A078201 #15 Aug 11 2014 23:35:30 %S A078201 2,3,17,5,59604644783353249,7, %T A078201 4318114567396436564035293097707729426477458833, %U A078201 205688069665150755269371147819668813122841983204711281293004769,593,11 %N A078201 Smallest prime of the form n^k + k^n, or 0 if no such prime exists. %C A078201 If p is a prime then a(p-1) = p, with k = 1. %C A078201 a(11) has 3229 digits and is too long to include. See A243147 for k-values. - _Derek Orr_, Aug 10 2014 %H A078201 R. J. Cano (updated by Derek Orr), <a href="/A078201/a078201.txt">Additional Information</a> %e A078201 a(3) = 3^2 + 2^3 = 17. %e A078201 a(4) = 4^1 + 1^4 = 5. %o A078201 See "Additional Information" in links. %o A078201 (PARI) %o A078201 a(n)=k=1;while(!ispseudoprime(n^k+k^n),k++);return(n^k+k^n) %o A078201 vector(10,n,a(n)) \\ _Derek Orr_, Aug 10 2014 %K A078201 hard,nonn %O A078201 1,1 %A A078201 _Amarnath Murthy_, Nov 21 2002 %E A078201 Extended and updated by _Derek Orr_, Aug 10 2014