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!)
A342411 a(n) = Sum_{k=1..n} (n/gcd(k,n))^(n/gcd(k,n) - 2). 2
1, 2, 7, 34, 501, 2600, 100843, 1048610, 28697821, 400000502, 23579476911, 247669459528, 21505924728445, 340163474352620, 15569560546875507, 576460752304472098, 45798768824157052689, 728637186579594211070, 98646963440126439346903 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{d|n} phi(d^(d-1)) = Sum_{d|n} phi(d) * d^(d-2).
G.f.: Sum_{k>=1} phi(k^(k-1))*x^k/(1 - x^k).
MATHEMATICA
a[n_] := Sum[(n/GCD[k, n])^(n/GCD[k, n] - 2), {k, 1, n}]; Array[a, 20] (* Amiram Eldar, Mar 11 2021 *)
PROG
(PARI) a(n) = sum(k=1, n, (n/gcd(k, n))^(n/gcd(k, n)-2));
(PARI) a(n) = sumdiv(n, d, eulerphi(d^(d-1)));
(PARI) a(n) = sumdiv(n, d, eulerphi(d)*d^(d-2));
(PARI) my(N=20, x='x+O('x^N)); Vec(sum(k=1, N, eulerphi(k^(k-1))*x^k/(1-x^k)))
CROSSREFS
Sequence in context: A222868 A222777 A222891 * A231580 A182408 A057298
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Mar 11 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 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)