A349373 Dirichlet convolution of Kimberling's paraphrases (A003602) with Dirichlet inverse of Euler phi (A023900).

1, 0, 0, -1, -1, 0, -2, -2, -1, 0, -4, 0, -5, 0, 2, -3, -7, 0, -8, 1, 3, 0, -10, 0, -3, 0, -2, 2, -13, 0, -14, -4, 5, 0, 8, 1, -17, 0, 6, 2, -19, 0, -20, 4, 5, 0, -22, 0, -5, 0, 8, 5, -25, 0, 14, 4, 9, 0, -28, -2, -29, 0, 8, -5, 17, 0, -32, 7, 11, 0, -34, 2, -35, 0, 4, 8, 23, 0, -38, 3, -3, 0, -40, -3, 23, 0, 14, 8

Offset: 1

Author

Antti Karttunen, Nov 15 2021

Keywords

• sign

Links

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

Crossrefs

Cf. A003602, A023900.

Cf. A347954, A347955, A347956, A349136, A349370, A349371, A349372, A349374, A349375, A349390, A349431, A349444, A349447 for Dirichlet convolutions of other sequences with A003602.

Programs

Mathematica

f[p_, e_] := (1 - p); d[1] = 1; d[n_] := Times @@ f @@@ FactorInteger[n]; k[n_] := (n / 2^IntegerExponent[n, 2] + 1)/2; a[n_] := DivisorSum[n, k[#] * d[n/#] &]; Array[a, 100] (* Amiram Eldar, Nov 16 2021 *)

PARI

A003602(n) = (1+(n>>valuation(n,2)))/2;
A023900(n) = factorback(apply(p -> 1-p, factor(n)[, 1]));
A349373(n) = sumdiv(n,d,A003602(n/d)*A023900(d));

Formula

a(n) = Sum_{d|n} A003602(n/d) * A023900(d).