cp's OEIS Frontend

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.

A070855 Smallest prime of the form k*n^n + 1.

Original entry on oeis.org

2, 5, 109, 257, 37501, 139969, 3294173, 167772161, 3874204891, 30000000001, 24536803672547, 17832200896513, 12115004263690121, 344472211592298497, 12261028930664062501, 221360928884514619393, 6617922095090694113417
Offset: 1

Views

Author

Amarnath Murthy, May 15 2002

Keywords

Comments

By Linnik's theorem, a(n) = O(n^(Ln)) for some effectively computable L.
For more terms, see A175763.

Crossrefs

Programs

  • 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 *)

Extensions

More terms from Don Reble, May 16 2002
Comments and b-file from Charles R Greathouse IV, Aug 30 2010