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.

A341412 a(n) = (Sum_{k=1..6} k^n) mod n.

Original entry on oeis.org

0, 1, 0, 3, 1, 1, 0, 3, 0, 1, 10, 7, 8, 7, 6, 3, 4, 13, 2, 15, 0, 3, 21, 19, 1, 13, 0, 7, 21, 1, 21, 3, 12, 23, 21, 31, 21, 15, 12, 35, 21, 13, 21, 31, 36, 45, 21, 19, 0, 1, 33, 39, 21, 31, 46, 35, 42, 33, 21, 55, 21, 29, 0, 3, 46, 49, 21, 31, 27, 21, 21, 67, 21, 17
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), A341410 (m=4), A341411 (m=5), this sequence (m=6), A341413 (m=7).

Programs

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

Formula

a(n) = A001553(n) mod n.
a(A056745(n)) = 0.

A133027 Divisors of 1701.

Original entry on oeis.org

1, 3, 7, 9, 21, 27, 63, 81, 189, 243, 567, 1701
Offset: 1

Views

Author

Omar E. Pol, Oct 27 2007

Keywords

Examples

			27*63 = 1701.
		

Crossrefs

Programs

Showing 1-2 of 2 results.