A349383 a(n) = A349381(n) + A349382(n).

2, 0, 0, 4, 0, 12, 0, 16, 9, 16, 0, 24, 0, 24, 24, 52, 0, 42, 0, 32, 36, 24, 0, 60, 16, 24, 63, 48, 0, 0, 0, 160, 36, 24, 48, 102, 0, 24, 36, 80, 0, 0, 0, 48, 84, 40, 0, 168, 36, 80, 36, 48, 0, 174, 48, 120, 36, 32, 0, 48, 0, 32, 126, 484, 48, 0, 0, 48, 60, 0, 0, 282, 0, 40, 120, 48, 72, 0, 0, 224, 351, 24, 0, 72, 48

Offset: 1

Author

Antti Karttunen, Nov 17 2021

Keywords

• nonn

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, A064989, A349381, A349382.

Cf. also A349357.

Programs

PARI

A349383(n) = (A349381(n)+A349382(n)); \\ Needs also code from A349381 and A349382.

Formula

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