A004829 Numbers that are the sum of at most 7 positive cubes.

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, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn
• easy

Comments

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

Links

• T. D. Noe, Table of n, a(n) for n = 1..1000
• 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.
• Samir Siksek, Every integer greater than 454 is the sum of at most seven positive cubes, Algebra and Number Theory 10:10 (2016), pp. 2093-2119.
• Index entries for linear recurrences with constant coefficients, signature (2,-1).
• Index entries for sequences related to sums of cubes

Crossrefs

Complement of A018889; subsequence of A003330.

Sums of k cubes, number of ways of writing n as, for k=1..9: A010057, A173677, A051343, A173678, A173679, A173680, A173676, A173681, A173682.

Cf. A018888.