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.
a(n) = { sqrtint(n*(n+1)*(2*n+1)/6)^2 } \\ Harry J. Smith, Oct 29 2009
a(n) = { sqrtint(n^n)^2 } \\ Harry J. Smith, Oct 29 2009
a(4) = A065730(4) mod 4 = 4 mod 4 = 0; a(5) = A065730(5) mod 5 = 9 mod 5 = 4; a(6) = A065730(6) mod 6 = 9 mod 6 = 3; a(7) = A065730(7) mod 7 = 16 mod 7 = 2.
Table[PowerMod[Floor[Sqrt[Prime[n]]],2,n],{n,72}] (* Stefano Spezia, Jan 02 2022 *)
a(n) = (sqrtint(prime(n))^2) % n; vector(20,n,a(n))
from sympy import prime, integer_nthroot def a(n): return (integer_nthroot(prime(n), 2)[0]**2)%n print([a(n) for n in range(1, 73)]) # Michael S. Branicky, Jan 02 2022
require 'prime'
values = []
Prime.first(20).each_with_index do |prime, i|
values << ((Integer.sqrt(prime) ** 2) % (i + 1))
end
p values