A324192 Number of distinct values A297167 obtains over divisors > 1 of n, minus number of distinct prime factors of n: a(n) = A324190(n) - A001221(n).

0, 0, 0, 1, 0, 0, 0, 2, 1, 0, 0, 1, 0, 0, 0, 3, 0, 1, 0, 2, 0, 0, 0, 2, 1, 0, 2, 2, 0, 0, 0, 4, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 2, 1, 0, 0, 3, 1, 1, 0, 2, 0, 2, 0, 4, 0, 0, 0, 1, 0, 0, 2, 5, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0, 1, 2, 0, 0, 0, 4, 3, 0, 0, 2, 0, 0, 0, 4, 0, 1, 0, 2, 0, 0, 0, 4, 0, 1, 2, 3, 0, 0, 0, 4, 0

Offset: 1

Author

Antti Karttunen, Feb 19 2019

Keywords

• nonn

Links

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

Crossrefs

Cf. A001222, A324179.

Programs

PARI

A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1])));
A297167(n) = if(1==n, 0, (A061395(n) + (bigomega(n)-omega(n)) - 1));
A324190(n) = #Set(apply(A297167, select(d -> d>1,divisors(n))));
A324192(n) = (A324190(n)-omega(n));

Formula

a(n) = A324190(n) - A001221(n).

a(n) >= A324179(n).