login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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

Cf. A121270, A110932, A175763.

Sequence in context: A237267 A215572 A023263 * A228850 A041237 A221476

Adjacent sequences:  A070852 A070853 A070854 * A070856 A070857 A070858

KEYWORD

nonn

AUTHOR

Amarnath Murthy, May 15 2002

EXTENSIONS

More terms from Don Reble (djr(AT)nk.ca), May 16 2002

Comments and b-file from Charles R Greathouse IV, Aug 30 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified December 19 16:00 EST 2014. Contains 252236 sequences.