|
%I #23 Dec 05 2018 05:10:20
%S 6,13,20,34,39,41,46,48,53,58,60,69,76,79,84,86,95,98,102,104,105,110,
%T 117,121,123,124,132,139,147,151,158,165,170,173,177,184,196,202,203,
%U 210,215,221,222,228,235,236,242,247,249,263,265,268,273,275,284,287
%N Numbers that are the sum of 6 but no fewer positive cubes.
%C According to the McCurley article, it is conjectured that there are exactly 3922 terms of which the largest is a(3922) = 1290740.
%H T. D. Noe, <a href="/A046040/b046040.txt">Table of n, a(n) for n=1..3922</a>
%H Jan Bohman and Carl-Erik Froberg, <a href="http://dx.doi.org/10.1007/BF01934077">Numerical investigation of Waring's problem for cubes</a>, Nordisk Tidskr. Informationsbehandling (BIT) 21 (1981), 118-122.
%H K. S. McCurley, <a href="http://dx.doi.org/10.1016/0022-314X(84)90100-8">An effective seven-cube theorem</a>, J. Number Theory, 19 (1984), 176-183.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CubicNumber.html">Cubic Number.</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem.</a>
%H <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a>
%t Select[Range[300], (pr = PowersRepresentations[#, 6, 3]; pr != {} && Count[pr, r_/; (Times @@ r) == 0] == 0)&] (* _Jean-François Alcover_, Jul 26 2011 *)
%Y Cf. A000578, A003325, A003072, A003327, A003328, A018890, A018889.
%K nonn,fini
%O 1,1
%A _Eric W. Weisstein_
%E Corrected by Arlin Anderson (starship1(AT)gmail.com).
|
