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 A047718 #16 Jul 22 2021 07:56:30
%S A047718 7,22,37,52,67,87,102,112,117,132,147,167,177,182,197,212,227,242,247,
%T A047718 262,277,292,307,322,327,342,352,357,372,387,402,407,417,422,437,452,
%U A047718 467,482,487,502,517,532,547,562,567,577,582,592,597,612,631,646,662
%N A047718 Numbers that are the sum of 7 but no fewer nonzero fourth powers.
%H A047718 David A. Corneth, <a href="/A047718/b047718.txt">Table of n, a(n) for n = 1..26439</a> (terms <= 200000)
%o A047718 (PARI) upto(n)={my(e=7); my(s=sum(k=1, sqrtint(sqrtint(n)), x^(k^4)) + O(x*x^n)); my(p=s^e, q=(1 + s)^(e-1)); select(k->polcoeff(p,k) && !polcoeff(q,k), [1..n])} \\ _Andrew Howroyd_, Jul 06 2018
%o A047718 (Python)
%o A047718 from itertools import combinations_with_replacement as mc
%o A047718 def aupto(limit):
%o A047718 qd = [k**4 for k in range(1, int(limit**.25)+2) if k**4 + 6 <= limit]
%o A047718 ss = [set(sum(c) for c in mc(qd, i)) for i in range(8)]
%o A047718 s7nf = ss[7] - ss[6] - ss[5] - ss[4] - ss[3] - ss[2] - ss[1]
%o A047718 return sorted(s for s in s7nf if s <= limit)
%o A047718 print(aupto(663)) # _Michael S. Branicky_, Jul 22 2021
%Y A047718 Cf. A000583, A002377, A003341.
%K A047718 nonn
%O A047718 1,1
%A A047718 Arlin Anderson (starship1(AT)gmail.com)