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 A351414 #16 Oct 06 2023 10:54:32
%S A351414 0,1,1,1,1,2,1,1,1,2,1,3,1,2,2,1,1,3,1,3,2,2,1,4,1,2,1,3,1,3,1,1,2,2,
%T A351414 2,5,1,2,2,4,1,3,1,3,3,2,1,5,1,3,2,3,1,4,2,4,2,2,1,6,1,2,3,1,2,3,1,3,
%U A351414 2,3,1,7,1,2,3,3,2,3,1,5,1,2,1,6,2,2,2,4,1,6,2,3,2,2,2,6
%N A351414 Number of divisors of n that are either prime or have at least 1 square divisor > 1 and at least two distinct prime factors.
%H A351414 Amiram Eldar, <a href="/A351414/b351414.txt">Table of n, a(n) for n = 1..10000</a>
%H A351414 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>
%F A351414 a(n) = Sum_{d|n} [[omega(d) = 1] = mu(d)^2], where [ ] is the Iverson bracket.
%F A351414 a(n) = A048105(n) + A361205(n). - _Amiram Eldar_, Oct 06 2023
%e A351414 a(24) = 4; 24 has divisors 2,3 (primes) and 12,24 (which both have at least 1 square divisor > 1 and at least two distinct prime factors).
%e A351414 a(36) = 5; 36 has divisors 2,3 (primes) and 12,18,36 (which all have at least 1 square divisor > 1 and at least two distinct prime factors).
%t A351414 a[n_] := Module[{e = FactorInteger[n][[;;, 2]], d, nu, omega}, d = Times @@ (e+1); nu = Length[e]; omega = Total[e]; d - 2^nu - omega + 2*nu]; a[1] = 0; Array[a, 100] (* _Amiram Eldar_, Oct 06 2023 *)
%o A351414 (PARI) a(n) = {my(f = factor(n), d = numdiv(f), nu = omega(f), om = bigomega(f)); d - 2^nu - om + 2*nu;} \\ _Amiram Eldar_, Oct 06 2023
%Y A351414 Cf. A001221 (omega), A008683 (mu), A048105, A361205.
%K A351414 nonn,easy
%O A351414 1,6
%A A351414 _Wesley Ivan Hurt_, Feb 10 2022