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.
Union[PowerMod[Range[48], 2, 48]] (* Alonso del Arte, Dec 24 2019 *)
[quadratic_residues(48)] # Zerinvary Lajos, May 24 2009
(1 to 48).map(n => (n * n) % 48).toSet.toSeq.sorted // Alonso del Arte, Dec 24 2019
R:= 0: s:= 1:
for n from 1 to 100 do
if floor(sqrt(s+n)) = floor(sqrt(s)) then
R:= R, n*s + n*(n+1)/2; s:= s+n;
else
R:= R, n*s + n*(n+1)/2 - floor(sqrt(s+n))^2 + s+n+1; s:= s+n+1;
fi
od:
R; # Robert Israel, Oct 02 2022
Table[Sum[
i + Floor[1/2 + Sqrt[i]], {i, n (n - 1)/2 + 1, (n + 1) (n)/2}], {n,
0, 40}]
Join[{0},Module[{nn=1000,nsi,len},nsi=Select[Range[nn],!IntegerQ[Sqrt[#]]&];len=Floor[ (Sqrt[ 8*Length[nsi]+1]-1)/2];Total/@TakeList[nsi,Range[len]]]] (* Harvey P. Dale, Jan 04 2024 *)
Comments