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.

A341410 a(n) = (Sum_{k=1..4} k^n) mod n.

Original entry on oeis.org

0, 0, 1, 2, 0, 0, 3, 2, 1, 0, 10, 6, 10, 2, 10, 2, 10, 12, 10, 14, 16, 8, 10, 18, 0, 4, 1, 18, 10, 0, 10, 2, 1, 30, 5, 30, 10, 30, 22, 34, 10, 18, 10, 2, 10, 30, 10, 18, 31, 0, 49, 42, 10, 30, 35, 2, 43, 30, 10, 54, 10, 30, 37, 2, 0, 6, 10, 14, 31, 60, 10, 66, 10, 30
Offset: 1

Views

Author

Seiichi Manyama, Feb 11 2021

Keywords

Crossrefs

(Sum_{k=1..m} k^n) mod n: A096196 (m=2), A341409 (m=3), this sequence (m=4), A341411 (m=5), A341412 (m=6), A341413 (m=7).

Programs

  • Maple
    a:= n-> add(i&^n, i=1..4) mod n:
    seq(a(n), n=1..100);  # Alois P. Heinz, Feb 11 2021
  • Mathematica
    a[n_] := Mod[Sum[k^n, {k, 1, 4}], n]; Array[a, 100] (* Amiram Eldar, Feb 11 2021 *)
  • PARI
    a(n) = sum(k=1, 4, k^n)%n;

Formula

a(n) = A001551(n) mod n.
a(A056643(n)) = 0.