OFFSET
1,2
COMMENTS
See also graph of this sequence and compare with the graph of A262744.
LINKS
Altug Alkan, Table of n, a(n) for n = 1..10000
Altug Alkan, Alternative Illustration of A282282
EXAMPLE
a(3) = 10 because (2^2 + 3^2 + 5^2) mod (1^2 + 2^2 + 3^2) = 10.
MATHEMATICA
Table[Mod[Total[Prime[Range@ n]^2], Binomial[n + 2, 3] + Binomial[n + 1, 3]], {n, 54}] (* Michael De Vlieger, Feb 11 2017 *)
PROG
(PARI) a(n) = sum(k=1, n, prime(k)^2) % (n*(n+1)*(2*n+1)/6);
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Altug Alkan, Feb 11 2017
STATUS
approved