Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Jul 31 2021 18:54:23
%S 944383,953139,953414,985453,1118585,1151438,1185375,1198879,1206546,
%T 1209912,1216569,1217172,1218912,1223321,1225398,1234631,1241834,
%U 1251195,1251406,1252123,1259685,1265563,1265594,1267937,1275375,1281736,1295418,1297697,1298088
%N Numbers that are the sum of ten fifth powers in exactly eight ways.
%C Differs from A345640 at term 8 because 1192180 = 5^5 + 5^5 + 5^5 + 5^5 + 6^5 + 6^5 + 6^5 + 6^5 + 10^5 + 16^5 = 2^5 + 5^5 + 5^5 + 5^5 + 5^5 + 8^5 + 8^5 + 8^5 + 8^5 + 16^5 = 3^5 + 4^5 + 4^5 + 5^5 + 6^5 + 6^5 + 6^5 + 8^5 + 13^5 + 15^5 = 3^5 + 4^5 + 4^5 + 4^5 + 6^5 + 7^5 + 7^5 + 7^5 + 13^5 + 15^5 = 2^5 + 2^5 + 2^5 + 3^5 + 8^5 + 8^5 + 9^5 + 9^5 + 12^5 + 15^5 = 1^5 + 1^5 + 5^5 + 6^5 + 6^5 + 6^5 + 6^5 + 12^5 + 13^5 + 14^5 = 1^5 + 2^5 + 3^5 + 3^5 + 3^5 + 10^5 + 10^5 + 12^5 + 13^5 + 13^5 = 1^5 + 2^5 + 2^5 + 2^5 + 4^5 + 11^5 + 11^5 + 12^5 + 12^5 + 13^5 = 6^5 + 9^5 + 9^5 + 10^5 + 11^5 + 11^5 + 11^5 + 11^5 + 11^5 + 11^5.
%H Sean A. Irvine, <a href="/A346353/b346353.txt">Table of n, a(n) for n = 1..10000</a>
%e 944383 is a term because 944383 = 4^5 + 4^5 + 4^5 + 6^5 + 7^5 + 8^5 + 8^5 + 8^5 + 9^5 + 15^5 = 2^5 + 5^5 + 5^5 + 5^5 + 6^5 + 6^5 + 8^5 + 10^5 + 12^5 + 14^5 = 2^5 + 4^5 + 5^5 + 5^5 + 7^5 + 7^5 + 7^5 + 10^5 + 12^5 + 14^5 = 2^5 + 4^5 + 4^5 + 6^5 + 6^5 + 6^5 + 9^5 + 11^5 + 11^5 + 14^5 = 1^5 + 3^5 + 5^5 + 6^5 + 6^5 + 8^5 + 8^5 + 11^5 + 11^5 + 14^5 = 1^5 + 3^5 + 4^5 + 7^5 + 7^5 + 7^5 + 8^5 + 11^5 + 11^5 + 14^5 = 1^5 + 3^5 + 4^5 + 6^5 + 7^5 + 7^5 + 8^5 + 12^5 + 12^5 + 13^5 = 1^5 + 1^5 + 2^5 + 6^5 + 7^5 + 10^5 + 11^5 + 11^5 + 12^5 + 12^5.
%o (Python)
%o from itertools import combinations_with_replacement as cwr
%o from collections import defaultdict
%o keep = defaultdict(lambda: 0)
%o power_terms = [x**5 for x in range(1, 1000)]
%o for pos in cwr(power_terms, 10):
%o tot = sum(pos)
%o keep[tot] += 1
%o rets = sorted([k for k, v in keep.items() if v == 8])
%o for x in range(len(rets)):
%o print(rets[x])
%Y Cf. A345640, A345860, A346343, A346352, A346354.
%K nonn
%O 1,1
%A _David Consiglio, Jr._, Jul 13 2021