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!)
 A261572 Minimum k such that k^6 can be expressed as the sum of n positive 6th powers. 0
 1141, 251, 54, 39, 18, 17, 16, 14, 4, 10, 11, 12, 9, 10, 7, 6, 8, 8, 9, 10, 10, 7, 5, 8, 8, 9, 9, 10, 7, 3, 8, 8, 9, 9, 10, 7, 5, 8, 8, 9, 9, 10, 7, 4, 8, 8, 9, 9, 10, 7, 4, 8, 8, 9, 9, 10, 7, 2, 8, 8, 9, 9, 10, 7, 5, 8, 8, 9, 9, 10, 7, 4, 8, 8, 9, 9, 10, 7, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 7,1 COMMENTS It is not known whether there exists a 6th power that can be expressed as the sum of 6 positive 6th powers. LINKS Eric W. Weisstein, Diophantine Equation--6th Powers EXAMPLE a(7) = 1141 because 1141^6 = 1077^6 + 894^6 + 702^6 + 474^6 + 402^6 + 234^6 + 74^6 and no integer smaller than 1141 can be expressed as the sum of 7 positive 6th powers. CROSSREFS Cf. A252476, A252486. Sequence in context: A353066 A206112 A232133 * A252476 A020397 A132410 Adjacent sequences: A261569 A261570 A261571 * A261573 A261574 A261575 KEYWORD nonn AUTHOR Jon E. Schoenfield, Aug 24 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 3 14:41 EST 2022. Contains 358534 sequences. (Running on oeis4.)