A130538 a(n) = exponent x of n needed to obtain A130537(n) = n^(a(n)) + (n+1)^(a(n)+1).

0, 1, 0, 1, 0, 2, 1, 1, 0, 1, 0, 1, 5, 1, 0, 15, 0, 1, 1, 1, 0, 3, 1, 3, 1, 2, 0, 9, 0, 1, 3, 12, 23, 1, 0, 2, 1, 1, 0, 1, 0, 5, 1, 1, 0, 3, 1, 2, 1, 2, 0, 1, 1, 1, 1, 6, 0, 1, 0, 3, 23875, 5, 1, 1, 0, 2, 1, 19, 0, 3, 0, 2, 23, 2, 1, 227, 0, 7, 219, 2, 0, 1

Offset

1,6

Comments

a(61) > 10000 if it exists. - Jason Yuen, Sep 24 2024

a(61) corresponds to a probable prime. - Jason Yuen, Oct 27 2024

a(145), a(181), and a(328) correspond to a probable prime. a(331) > 52000. - Jason Yuen, Nov 14 2024

Links

Jason Yuen, Table of n, a(n) for n = 1..330

Example

a(16)=15 because A130537(16) = 49814113380273715457 = 16^15 + 17^16.

Crossrefs

Cf. A130537.

Sequence in context: A378663 A328194 A131963 * A276007 A351619 A078659

Adjacent sequences: A130535 A130536 A130537 * A130539 A130540 A130541

Keyword

nonn,hard

Author

Tomas Xordan, Jun 02 2007

Extensions

a(61)-a(82) from Jason Yuen, Oct 27 2024

Status

approved