A308481 -id:A308481 - cp's OEIS frontend

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

José María Grau Ribas, Dec 09 2013

nonn

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

Cf. A231564, A231565, A308481.

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

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

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

A057792 Sum[k^k], where sum is over positive integers, k, where k <= n and gcd(k,n) = 1.

Original entry on oeis.org

1, 1, 5, 28, 288, 3126, 50069, 826696, 17604145, 388244060, 10405071317, 285312497280, 9211817190184, 303160805686506, 11415167261421900, 438197051187369424, 18896062057839751444, 827240565046755853710

Offset: 1

Leroy Quet, Nov 04 2000

nonn

			a(4) = 1^1 + 3^3 = 28, since 1 and 3 are the positive integers <= 4 and relatively prime to 4.

Seiichi Manyama, Table of n, a(n) for n = 1..387

Cf. A023896, A053818, A053819, A053820, A308481.

a(n) = sum(k=1, n, if (gcd(k, n)==1, k^k)); \\ Michel Marcus, Jun 19 2021

cp's OEIS Frontend

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.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula