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 A345635 #6 Jul 31 2021 15:58:17 %S A345635 8194,21940,52419,52450,52481,52661,52692,52903,53442,53473,53684, %T A345635 54465,54520,54551,54582,54762,54793,55004,55543,55574,55691,55722, %U A345635 55785,55933,56566,56714,57644,57675,57886,58667,58815,60194,60225,60436,60768,61217,62295 %N A345635 Numbers that are the sum of ten fifth powers in three or more ways. %H A345635 Sean A. Irvine, <a href="/A345635/b345635.txt">Table of n, a(n) for n = 1..10000</a> %e A345635 21940 is a term because 21940 = 1^5 + 2^5 + 2^5 + 5^5 + 5^5 + 5^5 + 5^5 + 5^5 + 5^5 + 5^5 = 1^5 + 3^5 + 4^5 + 4^5 + 4^5 + 4^5 + 4^5 + 4^5 + 6^5 + 6^5 = 3^5 + 3^5 + 3^5 + 3^5 + 3^5 + 4^5 + 4^5 + 5^5 + 6^5 + 6^5. %o A345635 (Python) %o A345635 from itertools import combinations_with_replacement as cwr %o A345635 from collections import defaultdict %o A345635 keep = defaultdict(lambda: 0) %o A345635 power_terms = [x**5 for x in range(1, 1000)] %o A345635 for pos in cwr(power_terms, 10): %o A345635 tot = sum(pos) %o A345635 keep[tot] += 1 %o A345635 rets = sorted([k for k, v in keep.items() if v >= 3]) %o A345635 for x in range(len(rets)): %o A345635 print(rets[x]) %Y A345635 Cf. A345596, A345620, A345634, A345636, A346348. %K A345635 nonn %O A345635 1,1 %A A345635 _David Consiglio, Jr._, Jun 20 2021