|
%I #22 Jun 29 2022 22:58:40
%S 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,16,17,18,19,20,21,24,25,26,27,28,
%T 29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,51,52,
%U 53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69
%N Numbers that are the sum of at most 7 positive cubes.
%C McCurley proves that every n > exp(exp(13.97)) is in A003330 and hence in this sequence. Siksek proves that all n > 454 are in this sequence. - _Charles R Greathouse IV_, Jun 29 2022
%H T. D. Noe, <a href="/A004829/b004829.txt">Table of n, a(n) for n=1..1000</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 Samir Siksek, <a href="https://msp.org/ant/2016/10-10/ant-v10-n10-p.pdf#page=43">Every integer greater than 454 is the sum of at most seven positive cubes</a>, Algebra and Number Theory 10:10 (2016), pp. 2093-2119.
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%H <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a>
%Y Complement of A018889.
%Y Sums of k cubes, number of ways of writing n as, for k=1..9: A010057, A173677, A051343, A173678, A173679, A173680, A173676, A173681, A173682.
%Y Cf. A018888, A003330.
%K nonn,easy
%O 1,3
%A _N. J. A. Sloane_
|
