A349386 a(n) = A349384(n) + A349385(n).

2, 0, 0, 1, 0, 4, 0, 3, 4, 6, 0, 2, 0, 10, 12, 7, 0, 0, 0, 3, 20, 12, 0, -4, 9, 16, 16, 5, 0, -36, 0, 15, 24, 18, 30, -10, 0, 22, 32, -6, 0, -60, 0, 6, 0, 28, 0, -20, 25, -3, 36, 8, 0, -20, 36, -10, 44, 30, 0, -48, 0, 36, 0, 31, 48, -72, 0, 9, 56, -90, 0, -32, 0, 40, -6, 11, 60, -96, 0, -30, 52, 42, 0, -80, 54, 46, 60

Offset: 1

Author

Antti Karttunen, Nov 17 2021

Keywords

• sign

Links

• Antti Karttunen, Table of n, a(n) for n = 1..20000
• Index entries for sequences computed from indices in prime factorization

Crossrefs

Cf. A003961, A048673, A349384, A349385.

Cf. also A349383.

Programs

PARI

A349386(n) = (A349384(n)+A349385(n)); \\ Needs also code from A349384 and A349385.

Formula

a(1) = 2, and for n > 1, a(n) = -Sum_{d|n, 1A349384(d) * A349385(n/d). [As the sequences are Dirichlet inverses of each other]