A353567 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

(list; graph; refs; listen; history; text; internal format)

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])))));