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
Examples
1^2 = 1^2. 414560^4 + 217519^4 + 95800^4 = 422481^4. 27^5 + 84^5 + 110^5 + 133^5 = 144^5.
Links
- Wikipedia, Fermat's Last Theorem
- Wikipedia, Lander, Parkin, and Selfridge conjecture
Crossrefs
Cf. A003828.
Comments