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.
6883 is a term because 6883 = 2^3 + 2^3 + 2^3 + 18^3 = 2^3 + 4^3 + 14^3 + 14^3 = 3^3 + 7^3 + 7^3 + 17^3 = 3^3 + 10^3 + 13^3 + 13^3 = 4^3 + 10^3 + 10^3 + 15^3 = 7^3 + 8^3 + 8^3 + 16^3.
from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**3 for x in range(1, 1000)]
for pos in cwr(power_terms, 4):
tot = sum(pos)
keep[tot] += 1
rets = sorted([k for k, v in keep.items() if v >= 6])
for x in range(len(rets)):
print(rets[x])
N:= 1000: # for terms <= N
B:= Vector(N):
for i from 1 while 4*i^2 <= N do
for j from i while i^2 + 3*j^2 <= N do
for k from j while i^2 + j^2 + 2*k^2 <= N do
for l from k do
m:= i^2 + j^2 + k^2 + l^2;
if m > N then break fi;
B[m]:= B[m]+1
od od od od:
select(t -> B[t] >= 7, [$1..N]); # Robert Israel, Oct 23 2020
limit = 8000
from functools import lru_cache
sq = [k**2 for k in range(1, int(limit**.5)+2) if k**2 + 3 <= limit]
sqs = set(sq)
@lru_cache(maxsize=None)
def findsums(n, m):
if m == 1: return {(n, )} if n in sqs else set()
return set(tuple(sorted(t+(s,))) for s in sqs for t in findsums(n-s, m-1))
print([n for n in range(4, limit+1) if len(findsums(n, 4)) == 6]) # Michael S. Branicky, Apr 20 2021