login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


A338656
a(n) = Sum_{d|n} mu(d) * binomial(d + n/d - 2, d-1).
2
1, 0, 0, -1, 0, -4, 0, -3, -5, -8, 0, -9, 0, -12, -28, -7, 0, -8, 0, -34, -54, -20, 0, 9, -69, -24, -44, -83, 0, 0, 0, -15, -130, -32, -418, 157, 0, -36, -180, -129, 0, 0, 0, -285, -494, -44, 0, 633, -923, -24, -304, -454, 0, 1090, -2000, -1183, -378, -56, 0, 3050, 0, -60, -3002, -31, -3638, 0
OFFSET
1,6
LINKS
FORMULA
G.f.: Sum_{k >= 1} mu(k) * (x/(1 - x^k))^k.
If p is prime, a(p) = 0.
MATHEMATICA
a[n_] := DivisorSum[n, MoebiusMu[#] * Binomial[# + n/# - 2, # - 1] &]; Array[a, 100] (* Amiram Eldar, Apr 22 2021 *)
PROG
(PARI) a(n) = sumdiv(n, d, moebius(d)*binomial(d+n/d-2, d-1));
(PARI) my(N=66, x='x+O('x^N)); Vec(sum(k=1, N, moebius(k)*(x/(1-x^k))^k))
CROSSREFS
KEYWORD
sign,look
AUTHOR
Seiichi Manyama, Apr 22 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 23 14:54 EDT 2024. Contains 376178 sequences. (Running on oeis4.)