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 A344238 #12 May 10 2024 02:20:28 %S A344238 260,275,340,515,884,1555,2595,2660,2675,2690,2705,2755,2770,2835, %T A344238 2930,2945,3010,3185,3299,3314,3379,3554,3923,3970,3985,4050,4115, %U A344238 4145,4160,4210,4225,4290,4355,4400,4465,4594,4769,4834,5075,5090,5155,5265,5330,5395,5440,5505,5570,5699,6370,6545,6580,6595,6610 %N A344238 Numbers that are the sum of five fourth powers in two or more ways. %H A344238 David Consiglio, Jr., <a href="/A344238/b344238.txt">Table of n, a(n) for n = 1..20000</a> %e A344238 340 = 1^4 + 1^4 + 1^4 + 3^4 + 4^4 %e A344238 = 2^4 + 3^4 + 3^4 + 3^4 + 3^4 %e A344238 so 340 is a term of this sequence. %o A344238 (Python) %o A344238 from itertools import combinations_with_replacement as cwr %o A344238 from collections import defaultdict %o A344238 keep = defaultdict(lambda: 0) %o A344238 power_terms = [x**4 for x in range(1, 50)] %o A344238 for pos in cwr(power_terms, 5): %o A344238 tot = sum(pos) %o A344238 keep[tot] += 1 %o A344238 rets = sorted([k for k, v in keep.items() if v >= 2]) %o A344238 for x in range(len(rets)): %o A344238 print(rets[x]) %Y A344238 Cf. A003339, A309763, A342685, A343702, A344237, A344243, A345559. %K A344238 nonn %O A344238 1,1 %A A344238 _David Consiglio, Jr._, May 12 2021