A329646 Inverse Möbius transform of A329643.

0, 0, 0, 1, 0, 2, 0, 3, 1, 2, 0, 9, 0, 2, 2, 9, 0, 7, 0, 10, 2, 2, 0, 27, 1, 2, 1, 21, 0, 17, 0, 15, 2, 2, 2, 36, 0, 2, 2, 36, 0, 23, 0, 23, 5, 2, 0, 61, 1, 4, 2, 51, 0, 23, 2, 51, 2, 2, 0, 70, 0, 2, 0, 45, 2, 42, 0, 87, 2, 25, 0, 90, 0, 2, 1, 261, 2, 44, 0, 70, 5, 2, 0, 117, 2, 2, 2, 97, 0, 55, 2, 231, 2, 2, 2, 143, 0, 7, 17, 49, 0, 100, 0, 189, 3

Offset: 1

Author

Antti Karttunen, Nov 21 2019

Keywords

• sign

Comments

a(117) = -9 is the first negative term. Of the first 10000 terms, 1441 are negative and 1233 are zero.

Links

• Antti Karttunen, Table of n, a(n) for n = 1..10000 (based on Hans Havermann's factorization of A156552)
• Index entries for sequences related to binary expansion of n
• Index entries for sequences computed from indices in prime factorization
• Index entries for sequences related to sigma(n)

Crossrefs

Cf. A006881, A323244, A329643, A329645.

Programs

PARI

A329646(n) = sumdiv(n,d,A329643(d));

Formula

a(n) = Sum_{d|n} A329643(d).

a(n) = A329645(n) - A323244(n).

For all n, a(A000040(n)) = 0, a(A006881(n)) = 2.