login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A342424 a(n) = Sum_{k=1..n} gcd(k,n)^(n/gcd(k,n)). 4
1, 3, 5, 10, 9, 33, 13, 60, 69, 167, 21, 470, 25, 837, 1245, 1624, 33, 5067, 37, 9570, 13841, 20633, 45, 54612, 12545, 98511, 119601, 201646, 57, 562957, 61, 794928, 1774185, 2097491, 536037, 5381754, 73, 9437601, 19136333, 14296940 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

a(n) = Sum_{d|n} phi(n/d) * d^(n/d).

MATHEMATICA

a[n_] := Sum[GCD[k, n]^(n/GCD[k, n]), {k, 1, n}]; Array[a, 40] (* Amiram Eldar, Mar 11 2021 *)

PROG

(PARI) a(n) = sum(k=1, n, gcd(k, n)^(n/gcd(k, n)));

(PARI) a(n) = sumdiv(n, d, eulerphi(n/d)*d^(n/d));

CROSSREFS

Cf. A000010, A332517, A342423.

Sequence in context: A069193 A078430 A345892 * A335003 A332049 A113858

Adjacent sequences:  A342421 A342422 A342423 * A342425 A342426 A342427

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 28 15:51 EDT 2021. Contains 346335 sequences. (Running on oeis4.)