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!)
A342395 a(n) = Sum_{k=1..n} k^(n/gcd(k,n)). 2
1, 3, 12, 90, 1305, 15713, 376768, 6163324, 176787369, 3769360335, 142364319636, 3152514811878, 154718778284161, 4340009168261557, 210971169749009040, 7281661102087491416, 435659030617933827153, 14181101408651996188995 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
If p is prime, a(p) = A121706(p) + p.
MATHEMATICA
a[n_] := Sum[k^(n/GCD[k, n]), {k, 1, n}]; Array[a, 18] (* Amiram Eldar, Mar 10 2021 *)
PROG
(PARI) a(n) = sum(k=1, n, k^(n/gcd(k, n)));
CROSSREFS
Sequence in context: A065087 A366733 A305870 * A058337 A025503 A363254
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 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)