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 A341524 #12 Dec 10 2023 17:23:28
%S A341524 0,1,1,2,1,0,1,3,2,1,1,1,1,1,1,4,1,2,1,2,2,1,1,1,2,1,3,0,1,1,1,5,1,1,
%T A341524 2,4,1,1,2,2,1,1,1,1,2,1,1,3,2,3,1,2,1,2,2,1,2,1,1,1,1,1,3,6,2,1,1,2,
%U A341524 1,2,1,4,1,1,3,1,2,1,1,4,4,1,1,1,2,1,1,2,1,1,1,1,2,1,1,3,1,3,2,4,1,1,1,3,2,1,1,3,1,2,2,2,1,1,2,2,2,1,2,0
%N A341524 Number of prime factors in A017666(n), counted with multiplicity: a(n) = bigomega(n) - bigomega(gcd(n, sigma(n))).
%H A341524 Antti Karttunen, <a href="/A341524/b341524.txt">Table of n, a(n) for n = 1..65537</a>
%H A341524 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A341524 a(n) = A001222(A017666(n)).
%F A341524 a(n) = A001222(n) - A341523(n).
%t A341524 Table[PrimeOmega[n] - PrimeOmega[GCD[n, DivisorSigma[1, n]]], {n, 1, 100}] (* _Amiram Eldar_, Feb 17 2021 *)
%o A341524 (PARI) A341524(n) = (bigomega(n) - bigomega(gcd(n, sigma(n))));
%Y A341524 Cf. A001222, A009194, A017666, A341523.
%Y A341524 Cf. A007691 (positions of zeros).
%Y A341524 Cf. A341608 (applied onto prime shift array A246278).
%K A341524 nonn
%O A341524 1,4
%A A341524 _Antti Karttunen_, Feb 17 2021