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 A193525 #16 Jul 06 2022 06:57:29
%S A193525 0,1,0,1,0,0,0,1,0,0,0,0,0,0,3,1,0,0,0,0,2,0,0,0,0,0,0,0,0,2,0,1,2,0,
%T A193525 4,0,0,0,4,0,0,4,0,0,3,0,0,0,0,0,4,0,0,0,4,0,2,0,0,2,0,0,2,1,3,4,0,0,
%U A193525 2,2,0,0,0,0,3,0,3,3,0,0,0,0,0,4,2,0
%N A193525 Number of even divisors of sopf(n).
%C A193525 Sopf(n) is the sum of the distinct primes dividing n (A008472).
%H A193525 Charles R Greathouse IV, <a href="/A193525/b193525.txt">Table of n, a(n) for n = 1..10000</a>
%F A193525 a(n) = A183063(A008472(n)). - _Amiram Eldar_, Jul 06 2022
%e A193525 a(15) = 3 because sopf(15) = 8 and its 3 even divisors are {2, 4, 8}.
%t A193525 f[n_] := Block[{d=Divisors[Plus@@First[Transpose[FactorInteger[n]]]]}, Count[EvenQ[d],True]]; Table[f[n] ,{n,100}]
%t A193525 Array[Count[Divisors[Total[FactorInteger[#][[All,1]]]],_?EvenQ]&,100] (* _Harvey P. Dale_, Jun 20 2019 *)
%t A193525 even[n_] := (e = IntegerExponent[n, 2]) * DivisorSigma[0, n / 2^e]; a[n_] := even[Plus @@ FactorInteger[n][[;;, 1]]]; Array[a, 100] (* _Amiram Eldar_, Jul 06 2022 *)
%o A193525 (PARI) sopf(n:int)=my(f=factor(n)[,1]); sum(i=1,#f,f[i])
%o A193525 a(n)=if(n==1,0,n=sopf(n);if(n%2,0,numdiv(n/2))) \\ _Charles R Greathouse IV_, Jul 31 2011
%Y A193525 Cf. A008472, A183063.
%K A193525 nonn
%O A193525 1,15
%A A193525 _Michel Lagneau_, Jul 29 2011