|
%I #9 Nov 26 2015 08:52:45
%S 1,0,422481,144
%N 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.
%C a(3) = 0 (as is the case under Fermat's last theorem).
%C Is the number of zero terms finite?
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem">Fermat's Last Theorem</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Lander,_Parkin,_and_Selfridge_conjecture">Lander, Parkin, and Selfridge conjecture</a>
%e 1^2 = 1^2.
%e 414560^4 + 217519^4 + 95800^4 = 422481^4.
%e 27^5 + 84^5 + 110^5 + 133^5 = 144^5.
%Y Cf. A003828.
%K nonn,hard,more
%O 2,3
%A _Arkadiusz Wesolowski_, Nov 23 2015
|
