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!)
A361019 Dirichlet inverse of A038712. 1
1, -3, -1, 2, -1, 3, -1, 0, 0, 3, -1, -2, -1, 3, 1, 0, -1, 0, -1, -2, 1, 3, -1, 0, 0, 3, 0, -2, -1, -3, -1, 0, 1, 3, 1, 0, -1, 3, 1, 0, -1, -3, -1, -2, 0, 3, -1, 0, 0, 0, 1, -2, -1, 0, 1, 0, 1, 3, -1, 2, -1, 3, 0, 0, 1, -3, -1, -2, 1, -3, -1, 0, -1, 3, 0, -2, 1, -3, -1, 0, 0, 3, -1, 2, 1, 3, 1, 0, -1, 0, 1, -2, 1, 3, 1, 0, -1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Multiplicative because A038712 is.
LINKS
FORMULA
a(1) = 1, and for n > 1, a(n) = -Sum_{d|n, d<n} A038712(n/d) * a(d).
Multiplicative with a(2) = -3, a(2^2) = 2, and a(2^e) = 0 for e > 2, and for odd prime p, a(p)= -1 and a(p^e) = 0 for e > 1. - Amiram Eldar, Mar 02 2023
MATHEMATICA
f[p_, e_] := If[e == 1, -1, 0]; f[2, e_] := If[e < 3, If[e == 1, -3, 2], 0]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Mar 02 2023 *)
PROG
(PARI)
A038712(n) = ((1<<(1+valuation(n, 2)))-1);
memoA361019 = Map();
A361019(n) = if(1==n, 1, my(v); if(mapisdefined(memoA361019, n, &v), v, v = -sumdiv(n, d, if(d<n, A038712(n/d)*A361019(d), 0)); mapput(memoA361019, n, v); (v)));
CROSSREFS
Cf. A038712.
Sequence in context: A352522 A256262 A332929 * A157520 A325116 A227339
KEYWORD
sign,mult
AUTHOR
Antti Karttunen, Mar 02 2023
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 August 17 05:44 EDT 2024. Contains 375200 sequences. (Running on oeis4.)