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!)
A359188 a(n) = Sum_{d|n} mu(n/d) * d * (n/d)^(d-1), where mu() is the Moebius function (A008683). 0
1, 1, 2, 0, 4, -11, 6, -24, -18, -79, 10, -276, 12, -447, -464, -1008, 16, -3636, 18, -5580, -5228, -11263, 22, -41184, -3100, -53247, -59022, -116004, 28, -454501, 30, -524256, -649868, -1114111, -121344, -4438368, 36, -4980735, -6909200, -11106720, 40, -44114197, 42 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
G.f.: Sum_{k>=1} mu(k) * x^k/(1 - k * x^k)^2.
If p is prime, a(p) = p - 1.
MATHEMATICA
a[n_] := DivisorSum[n, MoebiusMu[n/#] * # * (n/#)^(#-1) &]; Array[a, 45] (* Amiram Eldar, Aug 27 2023 *)
PROG
(PARI) a(n) = sumdiv(n, d, moebius(n/d)*d*(n/d)^(d-1));
(PARI) my(N=50, x='x+O('x^N)); Vec(sum(k=1, N, moebius(k)*x^k/(1-k*x^k)^2))
CROSSREFS
Sequence in context: A224822 A246928 A167341 * A361269 A343472 A214199
KEYWORD
sign
AUTHOR
Seiichi Manyama, Dec 19 2022
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 2 22:55 EDT 2024. Contains 372203 sequences. (Running on oeis4.)