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 A345719 #6 Jul 31 2021 16:37:35 %S A345719 54827300,74115800,74883600,75609125,113088250,120274275,166078869, %T A345719 169692136,174781858,178736448,182341225,185558208,194939538, %U A345719 203054589,218814275,235067008,250989825,251772882,252721458,255453233,258124975,274616694,282859667 %N A345719 Numbers that are the sum of six fifth powers in five or more ways. %H A345719 Sean A. Irvine, <a href="/A345719/b345719.txt">Table of n, a(n) for n = 1..10000</a> %e A345719 74115800 is a term because 74115800 = 1^5 + 4^5 + 21^5 + 21^5 + 29^5 + 34^5 = 1^5 + 8^5 + 14^5 + 23^5 + 32^5 + 32^5 = 4^5 + 11^5 + 13^5 + 22^5 + 24^5 + 36^5 = 5^5 + 6^5 + 19^5 + 20^5 + 24^5 + 36^5 = 6^5 + 25^5 + 25^5 + 25^5 + 29^5 + 30^5. %o A345719 (Python) %o A345719 from itertools import combinations_with_replacement as cwr %o A345719 from collections import defaultdict %o A345719 keep = defaultdict(lambda: 0) %o A345719 power_terms = [x**5 for x in range(1, 1000)] %o A345719 for pos in cwr(power_terms, 6): %o A345719 tot = sum(pos) %o A345719 keep[tot] += 1 %o A345719 rets = sorted([k for k, v in keep.items() if v >= 5]) %o A345719 for x in range(len(rets)): %o A345719 print(rets[x]) %Y A345719 Cf. A345562, A345608, A345718, A345720, A345863, A346360. %K A345719 nonn %O A345719 1,1 %A A345719 _David Consiglio, Jr._, Jun 24 2021