cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A263014 a(n) = Sum_{0 < a, b <= n and gcd(a^2 + b^2, n) = 1} (a + bi)^n (mod n).

Original entry on oeis.org

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

Views

Author

Keywords

Comments

Sum of the n-th powers of the invertible elements of Z[i]/nZ[i].

Crossrefs

See A263016 for indices where this is nonzero.
See A290287 for the nonzero values.

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}]

A290287 Nonzero entries in A263014 in order of appearance.

Original entry on oeis.org

8, 16, 32, 16, 24, 48, 64, 16, 84, 12, 32, 36, 64, 64, 52, 128, 56, 48, 128, 96, 68, 144, 256, 136, 252, 184, 108, 256, 208, 324, 512, 224, 232, 400, 192, 512, 384, 272, 232, 576, 148, 256, 36, 616, 208, 168, 344, 736, 432, 564, 64, 196, 328, 864, 204, 832, 212, 216, 960, 420, 896, 928, 400, 768, 1008, 424, 768, 480, 576
Offset: 1

Views

Author

Hans Havermann, Jul 26 2017

Keywords

Comments

a(n) = A263014(A263016(n)).

Crossrefs

Showing 1-2 of 2 results.