[Fwd: A063921]

[Robert G. Wilson v]

Robert G. Wilson v writes: The last entry is indeed incorrect but the title holds. If
someone has an efficient algorithm to compute the next two terms, I would be happy to run
it.

"David W. Wilson" wrote:

> > Dear Professor David Wilson,
> >
> > Your seq. A063921 is already in the EIS as A007666:
>
> [Note:  I am not a professor or doctor of anything.  The proper title is
> "Hacker David Wilson", but "Dave" will do.]
>
> > ID Number: A007666 (Formerly M3753)
> > Sequence:  1,5,6,353,72,1141
> > Name:      a(n) = smallest number k such that k^n is sum of n n-th powers, or 0 if no
> >               solution exists.
> > References D. Wells, The Penguin Dictionary of Curious and Interesting Numbers.
> >               Penguin Books, NY, 1986, 164.
> > See also:  k^n = T(n,1)^n + .. + T(n,n)^n, where T(,) is given in A061988.
> > Keywords:  nonn,hard,nice
> > Offset:    1
> > Author(s): njas, Robert G. Wilson v (rgwv at kspaint.com)
>
> Vladeta:  Thanks for pointing out the repeat.
> NJAS: Please see that A0063921 bites the dust.
>
> > But I am not sure that the last term in A007666 is correct since
> >
> > 74^6 + 234^6 + 402^6 + 474^6 + 702^6 + 894^6 + 1077^6 = 1141^6
>
> There is no 6-term rep for 1141^6?
>
> > All the best,
> >
> > Vladeta Jovovic