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!)
A332653 a(n) = (1/n) * Sum_{k=1..n} n^(k/gcd(n, k)). 3
1, 2, 5, 19, 157, 1306, 19609, 266372, 5321721, 101001214, 2593742461, 61920391842, 1941507093541, 56984643437138, 2076518238897649, 72340172854919941, 3041324492229179281, 121440691499123469858, 5784852794328402307381, 262799364106291328009626 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = (1/n) * Sum_{k=1..n} n^(lcm(n, k)/n).
a(n) = Sum_{d|n} Sum_{k=1..d, gcd(k, d) = 1} n^(k-1).
a(n) = A332652(n) / n.
MATHEMATICA
Table[(1/n) Sum[n^(k/GCD[n, k]), {k, 1, n}], {n, 1, 20}]
Table[Sum[Sum[If[GCD[k, d] == 1, n^(k - 1), 0], {k, 1, d}], {d, Divisors[n]}], {n, 1, 20}]
PROG
(Magma) [(1/n)*&+[n^(k div Gcd(n, k)):k in [1..n]]:n in [1..21]]; // Marius A. Burtea, Feb 18 2020
CROSSREFS
Sequence in context: A002786 A304982 A039719 * A198203 A014466 A304981
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Feb 18 2020
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 August 26 04:58 EDT 2024. Contains 375454 sequences. (Running on oeis4.)