This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A324192 #7 Feb 19 2019 18:20:26 %S A324192 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, %T A324192 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, %U A324192 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 %N 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). %H A324192 Antti Karttunen, <a href="/A324192/b324192.txt">Table of n, a(n) for n = 1..65537</a> %H A324192 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %F A324192 a(n) = A324190(n) - A001221(n). %F A324192 a(n) >= A324179(n). %o A324192 (PARI) %o A324192 A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1]))); %o A324192 A297167(n) = if(1==n, 0, (A061395(n) + (bigomega(n)-omega(n)) - 1)); %o A324192 A324190(n) = #Set(apply(A297167, select(d -> d>1,divisors(n)))); %o A324192 A324192(n) = (A324190(n)-omega(n)); %Y A324192 Cf. A001222, A324179. %K A324192 nonn %O A324192 1,8 %A A324192 _Antti Karttunen_, Feb 19 2019