A329639 Sum of -A329644(d) for all such divisors d of n for which A329644(d) < 0. Here A329644 is the Möbius transform of A323244, the deficiency of A156552(n).

0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 5, 0, 0, 0, 5, 0, 1, 0, 0, 0, 0, 0, 0, 0, 4, 5, 0, 0, 14, 0, 0, 5, 0, 0, 1, 0, 0, 0, 13, 5, 0, 0, 0, 1, 21, 0, 14, 0, 0, 0, 0, 0, 6, 8, 0, 0, 0, 0, 0, 4, 0, 5, 0, 0, 5, 0, 12, 14, 0, 0, 17, 0, 0, 26, 74, 0, 350, 40, 0, 14, 53, 0, 0, 0, 70, 0, 0, 13, 18, 7, 0, 0, 0, 0, 15

Offset: 1

Author

Antti Karttunen, Nov 21 2019

Keywords

• nonn

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. A323244, A329638, A329640, A329641, A329644.

Cf. also A318879.

Programs

PARI

A329639(n) = sumdiv(n,d,if((d=A329644(d))<0,-d,0));

Formula

a(n) = -Sum_{d|n} [A329644(d) < 0] * A329644(d), where [ ] is Iverson bracket.

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