A231563 a(n) = f(1)^n + ... + f(n)^n (mod n) where f(i)=i if gcd(i,n)=1 and f(i)=0 otherwise.

0, 1, 0, 2, 0, 2, 0, 4, 0, 0, 0, 4, 0, 0, 0, 8, 0, 6, 0, 8, 0, 0, 0, 8, 0, 0, 0, 0, 0, 20, 0, 16, 0, 0, 0, 12, 0, 0, 0, 16, 0, 12, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 18, 0, 0, 0, 0, 0, 16, 0, 0, 0, 32, 0, 44, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 0, 32, 0, 0

Offset

1,4

Links

Vincenzo Librandi, Table of n, a(n) for n = 1..5000

Formula

a(n) = A308481(n) mod n. - Seiichi Manyama, Feb 11 2021

Mathematica

S[n_] :=  Mod[Sum[If[GCD[i, n] == 1, PowerMod[i, n, n], 0], {i, 1, n}], n]; Array[S, 100]

Prog

(PARI) f(i, n) = if (gcd(i, n) == 1, i, 0);
a(n) = lift(sum(k=1, n, Mod(f(k, n), n)^n)); \\ Michel Marcus, Jul 16 2017

Crossrefs

Cf. A231564, A231565, A308481.

Sequence in context: A112631 A158706 A096500 * A282849 A111813 A346773

Adjacent sequences: A231560 A231561 A231562 * A231564 A231565 A231566

Keyword

nonn

Author

José María Grau Ribas, Dec 09 2013

Status

approved