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 A349620 #11 Nov 26 2021 10:33:59
%S A349620 0,1,1,3,1,2,1,8,4,2,1,5,1,2,2,20,1,7,1,5,2,2,1,12,6,2,15,5,1,3,1,48,
%T A349620 2,2,2,17,1,2,2,12,1,3,1,5,7,2,1,28,8,11,2,5,1,24,2,12,2,2,1,7,1,2,7,
%U A349620 112,2,3,1,5,2,3,1,40,1,2,11,5,2,3,1,28,54,2,1,7,2,2,2,12,1,10,2,5,2,2,2,64,1,15
%N A349620 Dirichlet convolution of A003415 with the Dirichlet inverse of A003958.
%H A349620 Antti Karttunen, <a href="/A349620/b349620.txt">Table of n, a(n) for n = 1..20000</a>
%F A349620 a(n) = Sum_{d|n} A003415(n/d) * A097945(d).
%t A349620 f[p_, e_] := e/p; d[1] = 0; d[n_] := n*Plus @@ f @@@ FactorInteger[n]; a[n_] := DivisorSum[n, MoebiusMu[#] * EulerPhi[#] * d[n/#] &]; Array[a, 100] (* _Amiram Eldar_, Nov 25 2021 *)
%o A349620 (PARI)
%o A349620 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A349620 A097945(n) = (moebius(n)*eulerphi(n)); \\ Also Dirichlet inverse of A003958.
%o A349620 A349620(n) = sumdiv(n,d,A003415(n/d)*A097945(d));
%Y A349620 Cf. A003415, A097945.
%Y A349620 Cf. also A349133, A349394, A349618, A349619, A349621.
%K A349620 nonn
%O A349620 1,4
%A A349620 _Antti Karttunen_, Nov 25 2021