Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Oct 19 2017 03:14:01
%S 2,5,109,257,37501,139969,3294173,167772161,3874204891,30000000001,
%T 24536803672547,17832200896513,12115004263690121,344472211592298497,
%U 12261028930664062501,221360928884514619393,6617922095090694113417
%N Smallest prime of the form k*n^n + 1.
%C By Linnik's theorem, a(n) = O(n^(Ln)) for some effectively computable L.
%C For more terms, see A175763.
%H Charles R Greathouse IV, <a href="/A070855/b070855.txt">Table of n, a(n) for n = 1..385</a>
%t 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 Cf. A121270, A110932, A175763.
%K nonn
%O 1,1
%A _Amarnath Murthy_, May 15 2002
%E More terms from _Don Reble_, May 16 2002
%E Comments and b-file from _Charles R Greathouse IV_, Aug 30 2010