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!)
A359588 Dirichlet inverse of A083346. 3
1, -2, -3, 3, -5, 6, -7, -6, 6, 10, -11, -9, -13, 14, 15, 12, -17, -12, -19, -15, 21, 22, -23, 18, 20, 26, -10, -21, -29, -30, -31, -24, 33, 34, 35, 18, -37, 38, 39, 30, -41, -42, -43, -33, -30, 46, -47, -36, 42, -40, 51, -39, -53, 20, 55, 42, 57, 58, -59, 45, -61, 62, -42, 48, 65, -66, -67, -51, 69 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Multiplicative because A083346 is.
LINKS
FORMULA
a(1) = 1, and for n > 1, a(n) = -Sum_{d|n, d<n} A083346(n/d) * a(d).
MATHEMATICA
f[p_, e_] := If[Divisible[e, p], 1, p]; s[1] = 1; s[n_] := Times @@ f @@@ FactorInteger[n]; a[1] = 1; a[n_] := a[n] = -DivisorSum[n, s[n/#]*a[#] &, # < n &]; Array[a, 100] (* Amiram Eldar, May 18 2023 *)
PROG
(PARI)
A083346(n) = { my(f=factor(n)); denominator(vecsum(vector(#f~, i, f[i, 2]/f[i, 1]))); };
memoA359588 = Map();
A359588(n) = if(1==n, 1, my(v); if(mapisdefined(memoA359588, n, &v), v, v = -sumdiv(n, d, if(d<n, A083346(n/d)*A359588(d), 0)); mapput(memoA359588, n, v); (v)));
CROSSREFS
Cf. A083346, A091428 (positions of odd terms), A359592 (parity of terms).
Cf. also A359577.
Sequence in context: A097247 A097246 A277886 * A337868 A063659 A255563
KEYWORD
sign,mult,look
AUTHOR
Antti Karttunen, Jan 09 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 April 30 06:10 EDT 2024. Contains 372127 sequences. (Running on oeis4.)