OFFSET
1,1
COMMENTS
Differs from A345180 at term 1 because 4392 = 1^3 + 1^3 + 10^3 + 10^3 + 11^3 = 1^3 + 2^3 + 2^3 + 9^3 + 14^3 = 1^3 + 8^3 + 9^3 + 10^3 + 10^3 = 2^3 + 2^3 + 3^3 + 5^3 + 15^3 = 2^3 + 3^3 + 5^3 + 8^3 + 14^3 = 2^3 + 8^3 + 8^3 + 8^3 + 12^3 = 3^3 + 6^3 + 7^3 + 8^3 + 13^3 = 5^3 + 5^3 + 5^3 + 9^3 + 13^3.
LINKS
David Consiglio, Jr., Table of n, a(n) for n = 1..10000
EXAMPLE
4472 is a term because 4472 = 1^3 + 4^3 + 4^3 + 4^3 + 15^3 = 2^3 + 2^3 + 9^3 + 11^3 + 11^3 = 2^3 + 3^3 + 4^3 + 5^3 + 15^3 = 2^3 + 3^3 + 7^3 + 11^3 + 12^3 = 3^3 + 3^3 + 6^3 + 10^3 + 13^3 = 3^3 + 4^3 + 5^3 + 8^3 + 14^3 = 5^3 + 5^3 + 7^3 + 10^3 + 12^3.
PROG
(Python)
from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**3 for x in range(1, 1000)]
for pos in cwr(power_terms, 5):
tot = sum(pos)
keep[tot] += 1
rets = sorted([k for k, v in keep.items() if v == 7])
for x in range(len(rets)):
print(rets[x])
CROSSREFS
KEYWORD
nonn
AUTHOR
David Consiglio, Jr., Jun 10 2021
STATUS
approved