A264764 a(n) = smallest positive k such that k^n is the sum of n-1 positive n-th powers, or 0 if no solution exists.

1, 0, 422481, 144

Offset

2,3

Comments

a(3) = 0 (as is the case under Fermat's last theorem).

Is the number of zero terms finite?

Links

Table of n, a(n) for n=2..5.

Wikipedia, Fermat's Last Theorem

Wikipedia, Lander, Parkin, and Selfridge conjecture

Example

1^2 = 1^2.
414560^4 + 217519^4 + 95800^4 = 422481^4.
27^5 + 84^5 + 110^5 + 133^5 = 144^5.

Crossrefs

Cf. A003828.

Sequence in context: A084734 A206684 A202405 * A130022 A175610 A003828

Adjacent sequences: A264761 A264762 A264763 * A264765 A264766 A264767

Keyword

nonn,hard,more

Author

Arkadiusz Wesolowski, Nov 23 2015

Status

approved