login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Numbers that are the sum of ten cubes in exactly eight ways.
6

%I #6 Jul 31 2021 22:27:34

%S 623,625,630,644,662,665,677,684,697,699,708,715,723,725,728,730,733,

%T 734,747,749,751,757,758,759,760,764,766,769,775,776,777,785,786,787,

%U 789,793,794,796,804,810,811,814,817,820,826,827,828,829,830,831,836,838

%N Numbers that are the sum of ten cubes in exactly eight ways.

%C Differs from A345556 at term 4 because 632 = 1^3 + 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 3^3 + 3^3 + 3^3 + 8^3 = 1^3 + 1^3 + 1^3 + 1^3 + 4^3 + 4^3 + 5^3 + 5^3 + 5^3 + 5^3 = 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 4^3 + 4^3 + 5^3 + 5^3 + 6^3 = 1^3 + 1^3 + 2^3 + 2^3 + 3^3 + 3^3 + 4^3 + 4^3 + 6^3 + 6^3 = 1^3 + 1^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 5^3 + 7^3 = 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 5^3 + 5^3 + 5^3 + 6^3 = 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 4^3 + 4^3 + 4^3 + 4^3 + 7^3 = 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 5^3 + 6^3 + 6^3 = 2^3 + 3^3 + 3^3 + 4^3 + 4^3 + 4^3 + 4^3 + 4^3 + 5^3 + 5^3.

%C Likely finite.

%H Sean A. Irvine, <a href="/A345810/b345810.txt">Table of n, a(n) for n = 1..75</a>

%e 625 is a term because 625 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 3^3 + 3^3 + 3^3 + 3^3 + 7^3 = 1^3 + 1^3 + 1^3 + 1^3 + 3^3 + 3^3 + 3^3 + 4^3 + 4^3 + 5^3 = 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 3^3 + 3^3 + 3^3 + 5^3 + 5^3 = 1^3 + 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 4^3 + 4^3 + 4^3 + 5^3 = 1^3 + 1^3 + 2^3 + 2^3 + 2^3 + 3^3 + 3^3 + 3^3 + 3^3 + 6^3 = 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 4^3 + 5^3 + 5^3 = 1^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 4^3 + 4^3 = 2^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 5^3.

%o (Python)

%o from itertools import combinations_with_replacement as cwr

%o from collections import defaultdict

%o keep = defaultdict(lambda: 0)

%o power_terms = [x**3 for x in range(1, 1000)]

%o for pos in cwr(power_terms, 10):

%o tot = sum(pos)

%o keep[tot] += 1

%o rets = sorted([k for k, v in keep.items() if v == 8])

%o for x in range(len(rets)):

%o print(rets[x])

%Y Cf. A345556, A345800, A345809, A345811, A345860.

%K nonn

%O 1,1

%A _David Consiglio, Jr._, Jun 26 2021