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!)
A342544 a(n) = Sum_{k=1..n} phi(gcd(k, n))^(gcd(k, n) - 1). 4
1, 2, 6, 11, 260, 40, 46662, 16398, 1679630, 262408, 10000000010, 4194366, 8916100448268, 13060740684, 4398046511640, 35184372105244, 18446744073709551632, 16926661124436, 39346408075296537575442, 144115188076118572, 3833759992447475215524, 1000000000010000000020 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{d|n} phi(n/d) * phi(d)^(d-1).
If p is prime, a(p) = p-1 + (p-1)^(p-1).
MATHEMATICA
a[n_] := DivisorSum[n, EulerPhi[n/#] * EulerPhi[#]^(# - 1) &]; Array[a, 20] (* Amiram Eldar, Mar 15 2021 *)
PROG
(PARI) a(n) = sum(k=1, n, eulerphi(gcd(k, n))^(gcd(k, n)-1));
(PARI) a(n) = sumdiv(n, d, eulerphi(n/d)*eulerphi(d)^(d-1));
CROSSREFS
Sequence in context: A368810 A208893 A057294 * A342540 A328449 A293589
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 June 29 06:36 EDT 2024. Contains 373826 sequences. (Running on oeis4.)