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!)
A342389 a(n) = Sum_{k=1..n} k^gcd(k,n). 3
1, 5, 30, 264, 3135, 46709, 823564, 16777528, 387420759, 10000003265, 285311670666, 8916100500148, 302875106592331, 11112006826381965, 437893890380965260, 18446744073726350224, 827240261886336764313, 39346408075296928032645 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
If p is prime, a(p) = A000217(p-1) + p^p = (p-1)*p/2 + p^p.
MATHEMATICA
a[n_] := Sum[k^GCD[k, n], {k, 1, n}]; Array[a, 18] (* Amiram Eldar, Mar 10 2021 *)
PROG
(PARI) a(n) = sum(k=1, n, k^gcd(k, n));
CROSSREFS
Sequence in context: A245247 A353547 A199131 * A344525 A277464 A258300
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Mar 10 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 19 14:10 EDT 2024. Contains 371792 sequences. (Running on oeis4.)