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.
selQ[n_] := Length[ Select[ PowersRepresentations[n, 4, 2], Times @@ # != 0 &]] >= 8; Select[ Range[300], selQ] (* Jean-François Alcover, Oct 03 2013 *)
f[n_] := Length@ PowersRepresentations[n, 4, 2]; Select[ Range@ 3500, f@# == 5 &] (* Robert G. Wilson v, Oct 27 2017 *)
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
Comments