The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A093574 Smallest prime of the form n^j+(n+1)^k, with j,k integer > 0. 2
 3, 5, 7, 29, 11, 13, 71, 17, 19, 131, 23, 157, 2393, 29, 31, 83537, 307, 37, 419, 41, 43, 1013, 47, 601, 701, 53, 757, 615497, 59, 61, 1049537, 2113, 67, 1259, 71, 73, 1481, 1483, 79, 1721, 83, 3613, 1979, 89, 2161, 4977017, 2351, 97, 2549, 101, 103, 2861 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Proposed by Leroy Quet, Mar 29 2004. Extended by R. K. Guy and Hugo Pfoertner. Every odd prime occurs at least once at positions given by A005097. LINKS EXAMPLE a(4)=29 because 4^1+5^2=29 is prime, whereas 4^1+5^1=9, 4^2+5=21 are composite. CROSSREFS Cf. A005097, A000040, A093575, A093576. Sequence in context: A083518 A061944 A288924 * A076846 A046931 A154551 Adjacent sequences:  A093571 A093572 A093573 * A093575 A093576 A093577 KEYWORD nonn AUTHOR Hugo Pfoertner, Apr 01 2004 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 November 27 15:33 EST 2020. Contains 338683 sequences. (Running on oeis4.)