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

 

Logo

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!)
A296137 Smallest difference between the sums of n-th powers in an ideal solution to Prouhet-Tarry-Escott problem of size n. 1
1, 2, 12, 144, 25200, 86400 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The smallest difference is delivered by the same ideal solutions as in A296136.

LINKS

Table of n, a(n) for n=1..6.

Wikipedia, Prouhet-Tarry-Escott problem

EXAMPLE

For n=4, the smallest difference is delivered by multisets {0,0,5,5} and {-1,2,3,6} with the sums of 4th powers equal 1250 and 1394, respectively. Their difference is 1394-1250 = 144 = a(4).

CROSSREFS

Cf. A296136.

Sequence in context: A221101 A187748 A324140 * A086928 A228551 A001927

Adjacent sequences:  A296134 A296135 A296136 * A296138 A296139 A296140

KEYWORD

nonn,hard,more

AUTHOR

Max Alekseyev, Dec 05 2017

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 11:47 EST 2022. Contains 358359 sequences. (Running on oeis4.)