login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #9 Apr 09 2014 10:13:40

%S 3,5,7,29,11,13,71,17,19,131,23,157,2393,29,31,83537,307,37,419,41,43,

%T 1013,47,601,701,53,757,615497,59,61,1049537,2113,67,1259,71,73,1481,

%U 1483,79,1721,83,3613,1979,89,2161,4977017,2351,97,2549,101,103,2861

%N Smallest prime of the form n^j+(n+1)^k, with j,k integer > 0.

%C 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.

%e a(4)=29 because 4^1+5^2=29 is prime, whereas 4^1+5^1=9, 4^2+5=21 are composite.

%Y Cf. A005097, A000040, A093575, A093576.

%K nonn

%O 1,1

%A _Hugo Pfoertner_, Apr 01 2004

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)