login

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”).

A070855
Smallest prime of the form k*n^n + 1.
3
2, 5, 109, 257, 37501, 139969, 3294173, 167772161, 3874204891, 30000000001, 24536803672547, 17832200896513, 12115004263690121, 344472211592298497, 12261028930664062501, 221360928884514619393, 6617922095090694113417
OFFSET
1,1
COMMENTS
By Linnik's theorem, a(n) = O(n^(Ln)) for some effectively computable L.
For more terms, see A175763.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..385
MATHEMATICA
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 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Amarnath Murthy, May 15 2002
EXTENSIONS
More terms from Don Reble, May 16 2002
Comments and b-file from Charles R Greathouse IV, Aug 30 2010
STATUS
approved