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 A345513 #6 Aug 05 2021 15:23:53 %S A345513 626,830,837,856,873,891,947,954,982,1008,1026,1045,1052,1053,1071, %T A345513 1094,1097,1106,1109,1134,1143,1150,1153,1169,1172,1195,1208,1227, %U A345513 1234,1241,1253,1260,1267,1278,1279,1283,1286,1290,1297,1316,1323,1324,1358,1361,1368 %N A345513 Numbers that are the sum of six cubes in four or more ways. %H A345513 Sean A. Irvine, <a href="/A345513/b345513.txt">Table of n, a(n) for n = 1..10000</a> %e A345513 830 is a term because 830 = 1^3 + 1^3 + 2^3 + 3^3 + 3^3 + 8^3 = 1^3 + 3^3 + 3^3 + 5^3 + 5^3 + 6^3 = 1^3 + 3^3 + 3^3 + 3^3 + 4^3 + 7^3 = 2^3 + 2^3 + 3^3 + 3^3 + 6^3 + 6^3. %o A345513 (Python) %o A345513 from itertools import combinations_with_replacement as cwr %o A345513 from collections import defaultdict %o A345513 keep = defaultdict(lambda: 0) %o A345513 power_terms = [x**3 for x in range(1, 1000)] %o A345513 for pos in cwr(power_terms, 6): %o A345513 tot = sum(pos) %o A345513 keep[tot] += 1 %o A345513 rets = sorted([k for k, v in keep.items() if v >= 4]) %o A345513 for x in range(len(rets)): %o A345513 print(rets[x]) %Y A345513 Cf. A344034, A344808, A345512, A345514, A345522, A345561, A345766. %K A345513 nonn %O A345513 1,1 %A A345513 _David Consiglio, Jr._, Jun 20 2021