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 A341636 #13 Sep 15 2023 05:53:07
%S A341636 1,4,6,13,10,24,14,38,29,40,22,78,26,56,60,103,34,116,38,130,84,88,46,
%T A341636 228,79,104,124,182,58,240,62,264,132,136,140,377,74,152,156,380,82,
%U A341636 336,86,286,290,184,94,618,153,316,204,338,106,496,220,532,228,232,118,780,122,248
%N A341636 a(n) = Sum_{d|n} phi(d) * tau(d) * tau(n/d).
%C A341636 Inverse Moebius transform of A062949.
%H A341636 Amiram Eldar, <a href="/A341636/b341636.txt">Table of n, a(n) for n = 1..10000</a>
%F A341636 a(n) = Sum_{k=1..n} tau(gcd(n,k)) * tau(n/gcd(n,k)).
%F A341636 a(n) = Sum_{d|n} A062949(d).
%F A341636 Multiplicative with a(p^e) = (p + 1 + e*(p-1) + p^(e+1)*(e*(p-1)+p-3))/(p-1)^2. - _Amiram Eldar_, Sep 15 2023
%t A341636 Table[Sum[EulerPhi[d] DivisorSigma[0, d] DivisorSigma[0, n/d], {d, Divisors[n]}], {n, 62}]
%t A341636 Table[Sum[DivisorSigma[0, GCD[n, k]] DivisorSigma[0, n/GCD[n, k]], {k, n}], {n, 62}]
%t A341636 f[p_, e_] := (p + 1 + e*(p - 1) + p^(e + 1)*(e*(p - 1) + p - 3))/(p - 1)^2; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Sep 15 2023 *)
%o A341636 (PARI) a(n) = sumdiv(n, d, eulerphi(d)*numdiv(d)*numdiv(n/d)); \\ _Michel Marcus_, Feb 17 2021
%Y A341636 Cf. A000005, A000010, A000203, A007426, A055507, A062355, A062949.
%K A341636 nonn,easy,mult
%O A341636 1,2
%A A341636 _Ilya Gutkovskiy_, Feb 16 2021