A263014 a(n) = Sum_{0 < a, b <= n and gcd(a^2 + b^2, n) = 1} (a + bi)^n (mod n).
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 32, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 64, 0, 0, 0, 0
Offset: 1
Keywords
Links
- Hans Havermann, Table of n, a(n) for n = 1..5000
Crossrefs
Programs
-
Mathematica
Sp[n_, k_] := Mod[Sum[If[GCD[a^2 + b^2, n] == 1, PowerMod[(a + b I), k, n], 0], {a, n}, {b, n}], n]; Table[ Sp[n, n] , {n, 1, 74}]
Comments