A349382 Dirichlet convolution of A064989 with A346234 (Dirichlet inverse of A003961), where A003961 and A064989 are fully multiplicative sequences that shift the prime factorization of n one step towards larger and smaller primes respectively.

1, -2, -3, -2, -4, 6, -6, -2, -6, 8, -6, 6, -6, 12, 12, -2, -6, 12, -6, 8, 18, 12, -10, 6, -12, 12, -12, 12, -8, -24, -8, -2, 18, 12, 24, 12, -10, 12, 18, 8, -6, -36, -6, 12, 24, 20, -10, 6, -30, 24, 18, 12, -12, 24, 24, 12, 18, 16, -8, -24, -8, 16, 36, -2, 24, -36, -10, 12, 30, -48, -6, 12, -8, 20, 36, 12, 36, -36

Offset

1,2

Comments

Multiplicative because both A064989 and A346234 are.

Links

Antti Karttunen, Table of n, a(n) for n = 1..20000

Index entries for sequences computed from indices in prime factorization

Formula

a(n) = Sum_{d|n} A064989(n/d) * A346234(d).

a(n) = A349383(n) - A349381(n).

Multiplicative with a(p^e) = -2 if p = 2, and prevprime(p)^e - nextprime(p) * prevprime(p)^(e-1) otherwise, where prevprime function is A151799 and nextprime function is A151800. - Amiram Eldar, Nov 17 2021

Mathematica

f[p_, e_] := If[p == 2, -2, NextPrime[p, -1]^e - NextPrime[p]*NextPrime[p, -1]^(e - 1)]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Nov 17 2021 *)

Prog

(PARI)
A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
A064989(n) = { my(f = factor(n)); if((n>1 && f[1, 1]==2), f[1, 2] = 0); for (i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); factorback(f); };
A346234(n) = (moebius(n)*A003961(n));
A349382(n) = sumdiv(n, d, A064989(n/d)*A346234(d));

Crossrefs

Cf. A003961, A064989, A151799, A151800, A346234, A349381 (Dirichlet inverse), A349383 (sum with it).

Cf. also A349355, A349356.

Sequence in context: A328879 A130542 A128502 * A244306 A345199 A079159

Adjacent sequences: A349379 A349380 A349381 * A349383 A349384 A349385

Keyword

sign,mult

Author

Antti Karttunen, Nov 17 2021

Status

approved