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 A359954 #26 May 17 2023 11:13:25
%S A359954 1,1,3,4,7,3,11,10,14,7,19,12,23,11,21,24,31,14,35,28,33,19,43,30,52,
%T A359954 23,54,44,55,21,59,56,57,31,77,56,71,35,69,70,79,33,83,76,98,43,91,72,
%U A359954 114,52,93,92,103,54,133,110,105,55,115,84,119,59,154,128,161,57,131
%N A359954 a(n) = Sum_{d|n} tau(d)*phi(d)*mu(n/d).
%C A359954 Möbius transform of tau(n)*phi(n) (A062355).
%H A359954 Amiram Eldar, <a href="/A359954/b359954.txt">Table of n, a(n) for n = 1..10000</a>
%H A359954 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%F A359954 Multiplicative with a(p) = 2*p - 3 and a(p^e) = (e*p + p - e)*(p - 1)*p^(e - 2) for e > 1. - _Amiram Eldar_, May 16 2023
%t A359954 f[p_, e_] := If[e == 1, 2*p - 3, (e*p + p - e)*(p - 1)*p^(e - 2)]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, May 16 2023 *)
%o A359954 (PARI) a(n) = sumdiv(n, d, numdiv(d)*eulerphi(d)*moebius(n/d)); \\ _Michel Marcus_, May 13 2023
%Y A359954 Cf. A000005 (tau), A000010 (phi), A008683 (mu), A062355, A363012.
%K A359954 nonn,easy,mult
%O A359954 1,3
%A A359954 _Wesley Ivan Hurt_, May 12 2023