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 A349621 #13 Nov 26 2021 11:13:41
%S A349621 0,1,1,1,1,-2,1,0,2,-2,1,-3,1,-2,-2,-4,1,-5,1,-3,-2,-2,1,-4,4,-2,3,-3,
%T A349621 1,3,1,-16,-2,-2,-2,-7,1,-2,-2,-4,1,3,1,-3,-5,-2,1,-4,6,-9,-2,-3,1,
%U A349621 -12,-2,-4,-2,-2,1,5,1,-2,-5,-48,-2,3,1,-3,-2,3,1,-8,1,-2,-9,-3,-2,3,1,-4,0,-2,1,5,-2,-2,-2,-4
%N A349621 Dirichlet convolution of A003415 with the Dirichlet inverse of A003959.
%H A349621 Antti Karttunen, <a href="/A349621/b349621.txt">Table of n, a(n) for n = 1..20000</a>
%F A349621 a(n) = Sum_{d|n} A003415(n/d) * A063441(d).
%t A349621 f[p_, e_] := e/p; d[1] = 0; d[n_] := n*Plus @@ f @@@ FactorInteger[n]; a[n_] := DivisorSum[n, MoebiusMu[#] * DivisorSigma[1, #] * d[n/#] &]; Array[a, 100] (* _Amiram Eldar_, Nov 25 2021 *)
%o A349621 (PARI)
%o A349621 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A349621 A063441(n) = (moebius(n)*sigma(n)); \\ Also Dirichlet inverse of A003959.
%o A349621 A349621(n) = sumdiv(n,d,A003415(n/d)*A063441(d));
%Y A349621 Cf. A003415, A003959, A063441.
%Y A349621 Cf. also A349173, A349394, A349618, A349619, A349620.
%K A349621 sign
%O A349621 1,6
%A A349621 _Antti Karttunen_, Nov 25 2021