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!)
A342420 a(n) = Sum_{k=1..n} (n/gcd(k,n))^(n/gcd(k,n)). 2
1, 5, 55, 517, 12501, 93371, 4941259, 67109381, 2324522989, 40000012505, 2853116706111, 35664401886907, 3634501279107037, 66672040958289359, 3503151123046887555, 147573952589743522309, 13235844190181388226833, 236078448451781550068849, 35611553801885644604231623 (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.
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]), {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)));
(PARI) a(n) = sumdiv(n, d, eulerphi(d^(d+1)));
(PARI) a(n) = sumdiv(n, d, eulerphi(d)*d^d);
(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: A247775 A045640 A043040 * A226561 A062183 A002279
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.)