The On-Line Encyclopedia of Integer Sequences (OEIS)

A341413 revision #13

A341413

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

0, 0, 1, 0, 3, 2, 0, 4, 1, 0, 6, 8, 2, 0, 4, 4, 11, 14, 9, 16, 7, 8, 5, 20, 8, 10, 1, 0, 28, 20, 28, 4, 25, 4, 14, 32, 28, 26, 4, 36, 28, 20, 28, 12, 28, 2, 28, 20, 0, 0, 19, 48, 28, 32, 34, 28, 43, 24, 28, 56, 28, 16, 28, 4, 18, 20, 28, 52, 25, 0, 28, 68, 28, 66, 19, 40

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,5

LINKS

Robert Israel, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = A001554(n) mod n.

a(A056750(n)) = 0.

If n is a prime >= 29, a(n) = 28. Robert Israel, Feb 09 2023

MAPLE

a:= n-> add(i&^n, i=1..7) mod n:

seq(a(n), n=1..100); # Alois P. Heinz, Feb 11 2021