OFFSET
1,1
COMMENTS
According to the McCurley article, it is conjectured that there are exactly 3922 terms of which the largest is a(3922) = 1290740.
LINKS
T. D. Noe, Table of n, a(n) for n=1..3922
Jan Bohman and Carl-Erik Froberg, Numerical investigation of Waring's problem for cubes, Nordisk Tidskr. Informationsbehandling (BIT) 21 (1981), 118-122.
K. S. McCurley, An effective seven-cube theorem, J. Number Theory, 19 (1984), 176-183.
Eric Weisstein's World of Mathematics, Cubic Number.
Eric Weisstein's World of Mathematics, Waring's Problem.
MATHEMATICA
Select[Range[300], (pr = PowersRepresentations[#, 6, 3]; pr != {} && Count[pr, r_/; (Times @@ r) == 0] == 0)&] (* Jean-François Alcover, Jul 26 2011 *)
CROSSREFS
KEYWORD
nonn,fini
AUTHOR
EXTENSIONS
Corrected by Arlin Anderson (starship1(AT)gmail.com).
STATUS
approved