A349399 a(n) = A349397(n) + A349398(n).

2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -10, 0, 0, 0, 0, 0, 16, 25, 0, 0, 0, 0, 0, 0, -80, 0, 0, 0, -12, 0, 0, 0, 64, 0, -6, 0, 0, 0, 60, 0, 4, 0, 0, 0, 0, 30, 0, 0, -96, 0, 0, 0, 18, 0, 0, 0, -48, 0, -10, 0, 0, 0, 0, 0, 24, 0, -190

Offset: 1

Author

Antti Karttunen, Nov 19 2021

Keywords

• sign

Links

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

Crossrefs

Cf. A048673, A064216, A349397, A349398.

Programs

PARI

A349399(n) = (A349397(n) + A349398(n)); \\ Needs also code from A349397 and A349398.

Formula

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