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 A047723 #19 Dec 27 2021 08:25:40 %S A047723 12,27,42,57,72,92,107,122,137,152,172,187,192,202,217,232,252,267, %T A047723 282,297,312,332,347,362,377,392,412,427,432,442,457,472,492,497,507, %U A047723 522,537,552,572,587,602,617,636,652,667,672,682,697,716,732,747,762 %N A047723 Sum of 12 but no fewer nonzero fourth powers. %H A047723 David A. Corneth, <a href="/A047723/b047723.txt">Table of n, a(n) for n = 1..13916</a> (terms <= 200000) %o A047723 (Python) %o A047723 from itertools import count, takewhile, combinations_with_replacement as mc %o A047723 def aupto(limit): %o A047723 qd = list(takewhile(lambda x: x <= limit, (k**4 for k in count(1)))) %o A047723 ss = [set(sum(c) for c in mc(qd, i)) for i in range(13)] %o A047723 for i in range(11, 0, -1): ss[12] -= ss[i] %o A047723 return sorted(s for s in ss[12] if s <= limit) %o A047723 print(aupto(762)) # _Michael S. Branicky_, Dec 27 2021 %Y A047723 Cf. A000583, A002377, A003346, A046044. %K A047723 nonn %O A047723 1,1 %A A047723 Arlin Anderson (starship1(AT)gmail.com) %E A047723 Typo in data corrected by _D. S. McNeil_, Aug 17 2010