This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A345624 #6 Jul 31 2021 16:09:16 %S A345624 1431398,1431429,1431640,1439173,1447570,1504636,1531397,1597929, %T A345624 1671167,1696159,1697686,1697928,1778835,1936454,1952415,1969221, %U A345624 1975049,2017344,2092122,2182161,2198967,2208680,2247917,2280818,2283911,2289343,2314335,2329845,2340319 %N A345624 Numbers that are the sum of nine fifth powers in seven or more ways. %H A345624 Sean A. Irvine, <a href="/A345624/b345624.txt">Table of n, a(n) for n = 1..10000</a> %e A345624 1431429 is a term because 1431429 = 1^5 + 2^5 + 2^5 + 6^5 + 7^5 + 12^5 + 12^5 + 13^5 + 14^5 = 1^5 + 2^5 + 2^5 + 7^5 + 7^5 + 11^5 + 11^5 + 14^5 + 14^5 = 1^5 + 2^5 + 5^5 + 8^5 + 8^5 + 8^5 + 8^5 + 14^5 + 15^5 = 1^5 + 5^5 + 6^5 + 6^5 + 6^5 + 6^5 + 10^5 + 14^5 + 15^5 = 2^5 + 2^5 + 2^5 + 4^5 + 10^5 + 11^5 + 11^5 + 12^5 + 15^5 = 2^5 + 3^5 + 3^5 + 3^5 + 10^5 + 10^5 + 10^5 + 13^5 + 15^5 = 2^5 + 3^5 + 5^5 + 6^5 + 7^5 + 8^5 + 11^5 + 11^5 + 16^5. %o A345624 (Python) %o A345624 from itertools import combinations_with_replacement as cwr %o A345624 from collections import defaultdict %o A345624 keep = defaultdict(lambda: 0) %o A345624 power_terms = [x**5 for x in range(1, 1000)] %o A345624 for pos in cwr(power_terms, 9): %o A345624 tot = sum(pos) %o A345624 keep[tot] += 1 %o A345624 rets = sorted([k for k, v in keep.items() if v >= 7]) %o A345624 for x in range(len(rets)): %o A345624 print(rets[x]) %Y A345624 Cf. A345591, A345615, A345623, A345625, A345639, A346342. %K A345624 nonn %O A345624 1,1 %A A345624 _David Consiglio, Jr._, Jun 20 2021