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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A342422 a(n) = Sum_{k=1..n} (n/gcd(k,n))^gcd(k,n). 2
 1, 3, 7, 13, 21, 39, 43, 81, 109, 173, 111, 475, 157, 507, 1107, 1153, 273, 2997, 343, 6133, 6685, 3479, 507, 30819, 13001, 10533, 44227, 65071, 813, 234959, 931, 215553, 368265, 136241, 414183, 1991281, 1333, 531471, 3215947, 4883141, 1641, 12951117, 1807, 12735043, 36892689, 8401259 (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(d^(n/d+1)) = Sum_{d|n} phi(d) * d^(n/d). MATHEMATICA a[n_] := Sum[(n/GCD[k, n])^GCD[k, n], {k, 1, n}]; Array[a, 50] (* Amiram Eldar, Mar 11 2021 *) PROG (PARI) a(n) = sum(k=1, n, (n/gcd(k, n))^gcd(k, n)); (PARI) a(n) = sumdiv(n, d, eulerphi(d^(n/d+1))); (PARI) a(n) = sumdiv(n, d, eulerphi(d)*d^(n/d)); CROSSREFS Cf. A000010, A342421. Sequence in context: A355736 A032606 A098482 * A147432 A018367 A146369 Adjacent sequences: A342419 A342420 A342421 * A342423 A342424 A342425 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.

Last modified September 29 14:55 EDT 2023. Contains 365772 sequences. (Running on oeis4.)