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!)
A332655 a(n) = Sum_{k=1..n} (k/gcd(n, k))^n. 3
1, 2, 10, 84, 1301, 15693, 376762, 6168552, 176787631, 3770427352, 142364319626, 3152758480715, 154718778284149, 4340093860950619, 210971170836848270, 7281694486114555088, 435659030617933827137, 14181121059071691716406, 1052864393300587929716722, 41673907052879908244100770 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{k=1..n} (lcm(n, k)/n)^n.
a(n) = Sum_{d|n} Sum_{k=1..d, gcd(k, d) = 1} k^n.
MATHEMATICA
Table[Sum[(k/GCD[n, k])^n, {k, 1, n}], {n, 1, 20}]
Table[Sum[Sum[If[GCD[k, d] == 1, k^n, 0], {k, 1, d}], {d, Divisors[n]}], {n, 1, 20}]
PROG
(Magma) [&+[(k div Gcd(n, k))^n:k in [1..n]]:n in [1..20]]; // Marius A. Burtea, Feb 18 2020
CROSSREFS
Sequence in context: A065866 A322406 A302935 * A156466 A304403 A132397
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 April 23 13:41 EDT 2024. Contains 371914 sequences. (Running on oeis4.)