OFFSET
1,1
COMMENTS
Differs from A345623 at term 30 because 1431398 = 2^5 + 5^5 + 5^5 + 5^5 + 6^5 + 7^5 + 10^5 + 12^5 + 16^5 = 1^5 + 3^5 + 5^5 + 6^5 + 7^5 + 8^5 + 11^5 + 11^5 + 16^5 = 1^5 + 1^5 + 5^5 + 8^5 + 8^5 + 8^5 + 8^5 + 14^5 + 15^5 = 2^5 + 3^5 + 4^5 + 4^5 + 7^5 + 8^5 + 12^5 + 13^5 + 15^5 = 1^5 + 3^5 + 3^5 + 3^5 + 10^5 + 10^5 + 10^5 + 13^5 + 15^5 = 1^5 + 2^5 + 2^5 + 4^5 + 10^5 + 11^5 + 11^5 + 12^5 + 15^5 = 1^5 + 1^5 + 2^5 + 7^5 + 7^5 + 11^5 + 11^5 + 14^5 + 14^5 = 1^5 + 1^5 + 2^5 + 6^5 + 7^5 + 12^5 + 12^5 + 13^5 + 14^5.
LINKS
Sean A. Irvine, Table of n, a(n) for n = 1..10000
EXAMPLE
926404 is a term because 926404 = 2^5 + 5^5 + 6^5 + 6^5 + 6^5 + 6^5 + 8^5 + 10^5 + 15^5 = 2^5 + 4^5 + 6^5 + 6^5 + 7^5 + 7^5 + 7^5 + 10^5 + 15^5 = 2^5 + 2^5 + 5^5 + 8^5 + 8^5 + 8^5 + 8^5 + 8^5 + 15^5 = 2^5 + 2^5 + 2^5 + 7^5 + 7^5 + 8^5 + 11^5 + 11^5 + 14^5 = 2^5 + 2^5 + 2^5 + 6^5 + 7^5 + 8^5 + 12^5 + 12^5 + 13^5 = 1^5 + 1^5 + 4^5 + 4^5 + 7^5 + 11^5 + 12^5 + 12^5 + 12^5.
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, 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 == 6])
for x in range(len(rets)):
print(rets[x])
CROSSREFS
KEYWORD
nonn
AUTHOR
David Consiglio, Jr., Jul 13 2021
STATUS
approved