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 A345595 #6 Jul 31 2021 17:25:37 %S A345595 265,280,295,310,325,340,345,355,360,375,390,405,420,425,440,455,470, %T A345595 485,505,520,535,550,565,580,585,595,600,615,630,645,660,665,680,695, %U A345595 710,725,745,760,775,790,805,820,835,840,855,870,885,889,900,904,919,920 %N A345595 Numbers that are the sum of ten fourth powers in two or more ways. %H A345595 Sean A. Irvine, <a href="/A345595/b345595.txt">Table of n, a(n) for n = 1..10000</a> %e A345595 280 is a term because 280 = 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 2^4 + 4^4 = 1^4 + 1^4 + 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 3^4 + 3^4 + 3^4. %o A345595 (Python) %o A345595 from itertools import combinations_with_replacement as cwr %o A345595 from collections import defaultdict %o A345595 keep = defaultdict(lambda: 0) %o A345595 power_terms = [x**4 for x in range(1, 1000)] %o A345595 for pos in cwr(power_terms, 10): %o A345595 tot = sum(pos) %o A345595 keep[tot] += 1 %o A345595 rets = sorted([k for k, v in keep.items() if v >= 2]) %o A345595 for x in range(len(rets)): %o A345595 print(rets[x]) %Y A345595 Cf. A003344, A345550, A345586, A345596, A345634, A345854. %K A345595 nonn %O A345595 1,1 %A A345595 _David Consiglio, Jr._, Jun 20 2021