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 A070855 #10 Oct 19 2017 03:14:01
%S A070855 2,5,109,257,37501,139969,3294173,167772161,3874204891,30000000001,
%T A070855 24536803672547,17832200896513,12115004263690121,344472211592298497,
%U A070855 12261028930664062501,221360928884514619393,6617922095090694113417
%N A070855 Smallest prime of the form k*n^n + 1.
%C A070855 By Linnik's theorem, a(n) = O(n^(Ln)) for some effectively computable L.
%C A070855 For more terms, see A175763.
%H A070855 Charles R Greathouse IV, <a href="/A070855/b070855.txt">Table of n, a(n) for n = 1..385</a>
%t A070855 sp[n_]:=Module[{n2=n^n,k=1},While[!PrimeQ[k*n2+1],k++];k*n2+1]; Array[ sp,20] (* _Harvey P. Dale_, Jul 06 2014 *)
%Y A070855 Cf. A121270, A110932, A175763.
%K A070855 nonn
%O A070855 1,1
%A A070855 _Amarnath Murthy_, May 15 2002
%E A070855 More terms from _Don Reble_, May 16 2002
%E A070855 Comments and b-file from _Charles R Greathouse IV_, Aug 30 2010