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 A193526 #14 Oct 22 2024 02:53:25
%S A193526 0,2,0,2,0,0,0,2,0,0,0,0,0,0,14,2,0,0,0,0,12,0,0,0,0,0,0,0,0,12,0,2,
%T A193526 16,0,24,0,0,0,30,0,0,24,0,0,14,0,0,0,0,0,36,0,0,0,30,0,24,0,0,12,0,0,
%U A193526 12,2,26,30,0,0,28,16,0,0,0,0,14,0,26,26,0,0
%N A193526 Sum of even divisors of sopf(n).
%C A193526 Sopf(n) is the sum of the distinct primes dividing n (A008472).
%H A193526 Antti Karttunen, <a href="/A193526/b193526.txt">Table of n, a(n) for n = 1..20000</a>
%F A193526 a(1) = 0; for n > 1, a(n) = A146076(A008472(n)). - _Antti Karttunen_, Dec 23 2018
%t A193526 Table[Total[Select[Divisors[Plus @@ First[Transpose[FactorInteger[n]]]], EvenQ[#] &]], {n, 100}]
%o A193526 (PARI)
%o A193526 A008472(n) = vecsum(factor(n)[, 1]); \\ From A008472
%o A193526 A146076(n) = if (n%2, 0, 2*sigma(n/2)); \\ From A146076
%o A193526 A193526(n) = if(1==n,0,A146076(A008472(n))); \\ _Antti Karttunen_, Dec 23 2018
%Y A193526 Cf. A008472, A146076, A193525.
%K A193526 nonn,easy
%O A193526 1,2
%A A193526 _Michel Lagneau_, Jul 29 2011