The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 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. 1
 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 4 15:38 EST 2022. Contains 358558 sequences. (Running on oeis4.)