The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A332658 a(n) = Sum_{k=1..n} mu(gcd(n, k)) * lcm(n, k) / gcd(n, k). 0
1, 1, 8, 14, 49, 26, 146, 112, 234, 149, 604, 238, 1013, 440, 842, 896, 2311, 702, 3248, 1386, 2491, 1814, 5818, 1904, 6200, 3041, 6318, 4102, 11773, 2524, 14414, 7168, 10277, 6935, 14504, 6552, 24641, 9746, 17230, 11088, 33619, 7471, 38828, 16926, 23166, 17456 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = Sum_{d|n} A007427(n/d) * A056789(d).
MATHEMATICA
Table[Sum[MoebiusMu[GCD[n, k]] LCM[n, k]/GCD[n, k], {k, 1, n}], {n, 1, 46}]
A007427[n_] := Sum[MoebiusMu[n/d] MoebiusMu[d], {d, Divisors[n]}]; A056789[n_] := Sum[LCM[n, k]/GCD[n, k], {k, 1, n}]; Table[Sum[A007427[n/d] A056789[d], {d, Divisors[n]}], {n, 1, 46}]
PROG
(Magma) [&+[MoebiusMu(Gcd(n, k))*Lcm(n, k)/ Gcd(n, k):k in [1..n]]:n in [1..50]]; // Marius A. Burtea, Feb 18 2020
(PARI) a(n) = sum(k=1, n, moebius(gcd(n, k))*lcm(n, k)/gcd(n, k)); \\ Michel Marcus, Feb 18 2020
CROSSREFS
Sequence in context: A242198 A111050 A009453 * A198307 A218555 A268160
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 May 15 02:15 EDT 2024. Contains 372536 sequences. (Running on oeis4.)