OFFSET
1,1
LINKS
David Consiglio, Jr., Table of n, a(n) for n = 1..1000
PROG
(Python)
from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**5 for x in range(1, 500)]
for pos in cwr(power_terms, 5):
tot = sum(pos)
keep[tot] += 1
rets = sorted([k for k, v in keep.items() if v >= 3])
for x in range(len(rets)):
print(rets[x])
CROSSREFS
KEYWORD
nonn
AUTHOR
David Consiglio, Jr., May 18 2021
STATUS
approved