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 A322581 #9 Dec 17 2018 16:20:43
%S A322581 2,0,0,1,0,4,0,1,4,8,0,2,0,12,16,1,0,4,0,4,24,20,0,2,16,24,8,6,0,0,0,
%T A322581 1,40,32,48,4,0,36,48,4,0,0,0,10,16,44,0,2,36,16,64,12,0,8,80,6,72,56,
%U A322581 0,8,0,60,24,1,96,0,0,16,88,0,0,4,0,72,32,18,120,0,0,4,16,80,0,12,128,84,112,10,0,16,144,22,120,92,144
%N A322581 Sum of A003958 and its Dirichlet inverse: a(n) = A003958(n) + A097945(n).
%H A322581 Antti Karttunen, <a href="/A322581/b322581.txt">Table of n, a(n) for n = 1..16384</a>
%F A322581 a(n) = A003958(n) + A097945(n).
%t A322581 a[1] = 2; a[n_] := Times @@ ((First[#] - 1)^Last[#] & /@ FactorInteger[n]) + MoebiusMu[n] * EulerPhi[n]; Array[a, 60] (* _Amiram Eldar_, Dec 17 2018 *)
%o A322581 (PARI)
%o A322581 A003958(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1]--); factorback(f); };
%o A322581 A097945(n) = (moebius(n)*eulerphi(n));
%o A322581 A322581(n) = (A003958(n)+A097945(n));
%Y A322581 Cf. A003958, A097945, A322582.
%Y A322581 Cf. also A319340.
%K A322581 nonn
%O A322581 1,1
%A A322581 _Antti Karttunen_, Dec 17 2018