login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A342540 a(n) = Sum_{k=1..n} phi(gcd(k, n))^(n-1). 4
1, 2, 6, 11, 260, 68, 46662, 16518, 1680134, 524296, 10000000010, 4204550, 8916100448268, 26121388044, 4398583447560, 35185445896204, 18446744073709551632, 33853319413772, 39346408075296537575442, 144116012711673868, 3833767304764361539596, 2000000000000000000020 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{d|n} phi(n/d) * phi(d)^(n-1).
If p is prime, a(p) = p-1 + (p-1)^(p-1).
MATHEMATICA
a[n_] := DivisorSum[n, EulerPhi[n/#] * EulerPhi[#]^(n - 1) &]; Array[a, 20] (* Amiram Eldar, Mar 15 2021 *)
PROG
(PARI) a(n) = sum(k=1, n, eulerphi(gcd(k, n))^(n-1));
(PARI) a(n) = sumdiv(n, d, eulerphi(n/d)*eulerphi(d)^(n-1));
CROSSREFS
Sequence in context: A208893 A057294 A342544 * A328449 A293589 A293117
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Mar 15 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 05:23 EDT 2024. Contains 371918 sequences. (Running on oeis4.)