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!)
A122900 Minimum prime of the form n^k + (n+1)^k for k>1, or 0 if no such prime exists. 3
5, 13, 337, 41, 61, 3697, 113, 10657, 181, 2211377674535255285545615254209921 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Currently a(n) is unknown 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 1 < k < 2^10 have been checked.

All nonzero a(n) have a form n^(2^m) + (n+1)^(2^m).

The exponents m are listed in A080121. The first occurrence of each exponent m in A080121 is listed in A122902.

LINKS

Table of n, a(n) for n=1..10.

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.

CROSSREFS

Cf. A077659, A080121, A122902, A080208.

Sequence in context: A085554 A226664 A067135 * A145557 A012033 A007540

Adjacent sequences:  A122897 A122898 A122899 * A122901 A122902 A122903

KEYWORD

hard,nonn

AUTHOR

Alexander Adamchuk, Sep 18 2006

EXTENSIONS

Edited by Max Alekseyev, Sep 09 2020

STATUS

approved

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 August 12 15:02 EDT 2022. Contains 356077 sequences. (Running on oeis4.)