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.
N:= 10^5: # generate all entries <=N
V:= Vector(N,datatype=integer[4]):
for a from 1 to floor(sqrt(N)) do
for b from a do
n:= a^2 + b^2;
if n > N then break fi;
V[n]:= V[n]+1
od od:
select(t -> V[t] >= 5, [$1..N]); # Robert Israel, Jun 01 2025
nn = 30000; t = Table[0, {nn}]; lim = Floor[Sqrt[nn - 1]]; Do[num = i^2 + j^2; If[num <= nn, t[[num]]++], {i, lim}, {j, i}]; Flatten[Position[t, ?(# >= 5 &)]] (* _T. D. Noe, Apr 07 2011 *)
Parallelize[Select[Range[120000],Length[PowersRepresentations[#,2,2]]>6&]] (* Harvey P. Dale, Feb 19 2011 *) nn = 112625; t = Table[0, {nn}]; lim = Floor[Sqrt[nn - 1]]; Do[num = i^2 + j^2; If[num <= nn, t[[num]]++], {i, lim}, {j, i}]; Flatten[Position[t, ?(# >= 7 &)]] (* _T. D. Noe, Apr 07 2011 *)
nn = 34850; t = Table[0, {nn}]; lim = Floor[Sqrt[nn - 1]]; Do[num = i^2 + j^2; If[num <= nn, t[[num]]++], {i, lim}, {j, i - 1}]; Flatten[Position[t, ?(# >= 6 &)]] (* _T. D. Noe, Apr 07 2011 *)
Comments