This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A084047 Smallest prime p such that p - n is an n-th power, or 0 if no such number exists; i.e., smallest prime of the form k^n + n. 3
 2, 3, 11, 5, 37, 7, 268435463, 6569, 521, 11, 36028797018963979, 13, 859935929762876868984659981, 4807339234680508004200143948920808143, 32783, 17, 30491346729331195921, 19, 32064977213018365645815827 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE a(2) = 3 = 1^2 + 2; a(4) = 5 = 1^4 + 4; a(6) = 7 = 1^6 + 6. In general, if n+1 is prime, then a(n) = n + 1 = 1^n + n. CROSSREFS Cf. A084046. Sequence in context: A137332 A292473 A269253 * A282770 A145077 A127376 Adjacent sequences:  A084044 A084045 A084046 * A084048 A084049 A084050 KEYWORD base,nonn AUTHOR Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 26 2003 EXTENSIONS Corrected and extended by Ray Chandler, Jun 16 2003 STATUS approved

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

Last modified December 5 10:45 EST 2019. Contains 329751 sequences. (Running on oeis4.)