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

A263016 Numbers n such that A263014(n) > 0.

Original entry on oeis.org

20, 24, 40, 48, 60, 80, 96, 120, 140, 156, 160, 180, 192, 240, 260, 272, 280, 312, 320, 336, 340, 360, 384, 408, 420, 460, 468, 480, 520, 540, 544, 560, 580, 600, 624, 640, 672, 680, 696, 720, 740, 768, 780
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    sumin[n_, k_] := Mod[Sum[If[GCD[i, n] == 1, PowerMod[i, k, n], 0], {i, 1, n}], n]; Select[Range[100], sumin[#, #] > 0 &]
Showing 1-2 of 2 results.