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!)
A307428 Dirichlet g.f.: zeta(2*s) / (zeta(s) * zeta(3*s)). 3
1, -1, -1, 1, -1, 1, -1, -2, 1, 1, -1, -1, -1, 1, 1, 2, -1, -1, -1, -1, 1, 1, -1, 2, 1, 1, -2, -1, -1, -1, -1, -2, 1, 1, 1, 1, -1, 1, 1, 2, -1, -1, -1, -1, -1, 1, -1, -2, 1, -1, 1, -1, -1, 2, 1, 2, 1, 1, -1, 1, -1, 1, -1, 2, 1, -1, -1, -1, 1, -1, -1, -2, -1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,8
COMMENTS
Dirichlet convolution of A307423 and A008683.
LINKS
Eric Weisstein's World of Mathematics, Dirichlet Generating Function.
Wikipedia, Dirichlet series.
FORMULA
Multiplicative with a(p) = -1, a(p^2) = 1, and a(p^e) = 2*(-1)^e for e >= 3. - Amiram Eldar, Dec 25 2022
MATHEMATICA
nmax = 100; A307423 = Table[DivisorSum[n, Boole[Max[FactorInteger[#][[All, 2]]] < 3] * LiouvilleLambda[n/#]&], {n, 1, nmax}]; Table[DivisorSum[n, MoebiusMu[#] * A307423[[n/#]] &], {n, 1, nmax}]
f[p_, e_] := 2*(-1)^e; f[p_, 1] := -1; f[p_, 2] := 1; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Dec 25 2022 *)
PROG
(PARI) for(n=1, 100, print1(direuler(p=2, n, (1-X^3)/(1+X))[n], ", ")) \\ Vaclav Kotesovec, Jun 14 2020
CROSSREFS
Sequence in context: A365634 A320267 A304327 * A368248 A362852 A061704
KEYWORD
sign,mult
AUTHOR
Vaclav Kotesovec, Apr 08 2019
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 23 16:36 EDT 2024. Contains 372765 sequences. (Running on oeis4.)