The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 0
 1, 0, 422481, 144 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,3 COMMENTS a(3) = 0 (as is the case under Fermat's last theorem). Is the number of zero terms finite? LINKS 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

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.

Last modified September 23 10:51 EDT 2020. Contains 337298 sequences. (Running on oeis4.)