A353567 Number of divisors d of n such that d is a multiple of its prime shadow A181819(d).

1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 6, 1, 2, 1, 3, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 4, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 2, 1, 3, 2, 2, 1, 4, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 6

Offset

1,2

Comments

Number of terms of A325755 that divide n.

Links

Antti Karttunen, Table of n, a(n) for n = 1..65537

Formula

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

Prog

(PARI)
A353566(n) = (0==(n%factorback(apply(e->prime(e), (factor(n)[, 2])))));
A353567(n) = sumdiv(n, d, A353566(d));

Crossrefs

Inverse Möbius transform of A353566.

Cf. A181819, A325755.

Sequence in context: A107459 A087976 A227903 * A117277 A033831 A338650

Adjacent sequences: A353564 A353565 A353566 * A353568 A353569 A353570

Keyword

nonn

Author

Antti Karttunen, Apr 29 2022

Status

approved