|
|
A345809
|
|
Numbers that are the sum of ten cubes in exactly seven ways.
|
|
6
|
|
|
440, 473, 499, 506, 525, 532, 534, 567, 571, 584, 588, 597, 599, 604, 606, 627, 637, 639, 640, 656, 660, 663, 669, 670, 673, 680, 682, 689, 691, 693, 696, 701, 702, 704, 707, 717, 718, 719, 726, 729, 735, 738, 743, 744, 750, 755, 761, 762, 763, 770, 783, 784
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Differs from A345555 at term 16 because 623 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 3^3 + 5^3 + 5^3 + 5^3 + 6^3 = 1^3 + 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 3^3 + 5^3 + 6^3 + 6^3 = 1^3 + 1^3 + 1^3 + 2^3 + 2^3 + 2^3 + 4^3 + 4^3 + 5^3 + 7^3 = 1^3 + 1^3 + 3^3 + 3^3 + 4^3 + 4^3 + 4^3 + 5^3 + 5^3 + 5^3 = 1^3 + 2^3 + 3^3 + 3^3 + 3^3 + 4^3 + 4^3 + 4^3 + 5^3 + 6^3 = 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 6^3 + 7^3 = 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 4^3 + 5^3 + 5^3 + 5^3 + 5^3 = 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 4^3 + 7^3.
Likely finite.
|
|
LINKS
|
|
|
EXAMPLE
|
473 is a term because 473 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 4^3 + 4^3 + 5^3 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 5^3 + 5^3 = 1^3 + 1^3 + 1^3 + 1^3 + 3^3 + 3^3 + 3^3 + 3^3 + 4^3 + 4^3 = 1^3 + 1^3 + 1^3 + 2^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 5^3 = 1^3 + 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 4^3 + 4^3 + 4^3 = 1^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 3^3 + 4^3 + 5^3 = 2^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^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, 10):
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
|
|
|
STATUS
|
approved
|
|
|
|