A345544 Numbers that are the sum of nine cubes in five or more ways.

409, 413, 428, 435, 439, 446, 465, 472, 479, 491, 498, 502, 505, 507, 512, 517, 524, 526, 531, 533, 535, 538, 540, 559, 561, 563, 566, 568, 570, 576, 579, 580, 587, 594, 596, 598, 600, 601, 603, 605, 613, 615, 617, 620, 622, 624, 627, 629, 631, 632, 633, 635

Offset: 1

Author

David Consiglio, Jr., Jun 20 2021

Keywords

• nonn

Examples

			413 is a term because 413 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 3^3 + 3^3 + 3^3 + 5^3 = 1^3 + 1^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 = 1^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 4^3 + 4^3 = 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 3^3 + 3^3 + 3^3 + 4^3 = 2^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 5^3.
		

Links

• Sean A. Irvine, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A345502, A345535, A345543, A345545, A345553, A345589, A345797.

Programs

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, 9):
    tot = sum(pos)
    keep[tot] += 1
    rets = sorted([k for k, v in keep.items() if v >= 5])
    for x in range(len(rets)):
        print(rets[x])