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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057856 Least k such that (n+1)^k + n^k is a prime. 3
1, 1, 1, 2, 1, 1, 2, 1, 1, 32, 1, 2, 4, 1, 1, 4, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Note: k must be of the form 2^m (see A058064 for the m values).

Conjecture: For every pair of relatively prime numbers (x, y) there exist at least one number n=2^m and one prime number p such that p = x^n + y^n. This sequence shows one case of this conjecture where y = x + 1. - Tomas Xordan, Jun 02 2007

LINKS

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

EXAMPLE

a(101)=16 because 101^16 + 102^16 = 254536435001431070450581794495937.

MATHEMATICA

Do[ k = 0; While[ !PrimeQ[ (n + 1)^(2^k) + n^(2^k) ], k++ ]; Print[ 2^k ], {n, 1, 60} ].

PROG

(PARI) a(n) = my(k=1); while (!isprime(p=(n+1)^k + n^k), k++); k; \\ Michel Marcus, Sep 16 2018

CROSSREFS

Cf. A058064, A130536.

Sequence in context: A238904 A214501 A318665 * A117939 A321436 A276167

Adjacent sequences:  A057853 A057854 A057855 * A057857 A057858 A057859

KEYWORD

nonn,hard

AUTHOR

Robert G. Wilson v, Nov 14 2000

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 26 00:08 EST 2020. Contains 332270 sequences. (Running on oeis4.)