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 A345010 #28 Jul 31 2021 17:03:35 %S A345010 1375298099,1419138368,2370099168,5839897526,16681039431,27326512069, %T A345010 28461637018,34090335168,44009539168,45412427776,47166830151, %U A345010 57788232400,75843173376,89516861675,89636142881,140201053499,186876720832,191701358025,209797492893,220333644849 %N A345010 Numbers that are the sum of three fifth powers in two or more ways. %C A345010 No numbers that are the sum of three fifth powers in three ways have been found. As a result, there is no corresponding sequence for the sum of three fifth powers in exactly two ways. %H A345010 David Consiglio, Jr., <a href="/A345010/b345010.txt">Table of n, a(n) for n = 1..396</a> %e A345010 1419138368 is a term because 1419138368 = 13^5 + 51^5 + 64^5 = 18^5 + 44^5 + 66^5. %o A345010 (Python) %o A345010 from itertools import combinations_with_replacement as cwr %o A345010 from collections import defaultdict %o A345010 keep = defaultdict(lambda: 0) %o A345010 power_terms = [x**5 for x in range(1, 1000)] %o A345010 for pos in cwr(power_terms, 3): %o A345010 tot = sum(pos) %o A345010 keep[tot] += 1 %o A345010 rets = sorted([k for k, v in keep.items() if v >= 2]) %o A345010 for x in range(len(rets)): %o A345010 print(rets[x]) %Y A345010 Cf. A003348, A309762, A344644. %K A345010 nonn %O A345010 1,1 %A A345010 _David Consiglio, Jr._, Jun 14 2021