OFFSET
1,1
COMMENTS
Sequence is conjectured to be finite.
Comment from Richard C. Schroeppel, Sep 22 2010: It is conjectured that 7373170279850 is the largest number requiring more than four cubes (see Deshouillers et al.).
REFERENCES
Bohman, Jan and Froberg, Carl-Erik; Numerical investigation of Waring's problem for cubes, Nordisk Tidskr. Informationsbehandling (BIT) 21 (1981), 118-122.
F. Romani, Computations concerning Waring's problem, Calcolo, 19 (1982), 415-431.
LINKS
T. D. Noe, Table of n, a(n) for n=1..4060
Jean-Marc Deshouillers, Francois Hennecart and Bernard Landreau; appendix by I. Gusti Putu Purnaba, 7373170279850, Math. Comp. 69 (2000), 421-439.
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Apr 08 2002
STATUS
approved