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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A122900 Minimum prime of the form (n^k + (n+1)^k) for k>1, or 1 if such prime does not exist or if it is still not found. 3
 5, 13, 337, 41, 61, 3697, 113, 10657, 181, 2211377674535255285545615254209921, 1, 313, 66977, 421, 1, 149057, 613, 1, 761, 1, 4441930186581050471617, 1013, 188386299457, 1201, 1301, 988417, 1146097, 1, 1741, 1861, 1972097, 2113, 2522257 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Currently a(n) = 1 for n = {11,15,18,20,28,44,46,49,51,52,53,55,57,58,61,62,64,71,73,77,81,83,91,92,94,...}. All n<100 and 10 in A122901[n] is listed in A122902[m] ={1,3,23,21,10,95,...}. LINKS EXAMPLE a(1) = 5 because 1^2 + 2^2 = 5 is prime. a(2) = 13 because 2^2 + 3^2 = 13 is prime. a(3) = 337 because 3^4 + 4^4 = 337 is prime but 3^3 + 4^3 = 91 and 3^2 + 4^2 = 25 are composite. a(11) = 1 because prime of the form 11^k + 12^k is not found for 1

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 February 25 05:11 EST 2020. Contains 332217 sequences. (Running on oeis4.)