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 A363012 #17 May 17 2023 11:13:55
%S A363012 1,3,11,20,39,33,83,104,150,117,219,220,311,249,429,512,543,450,683,
%T A363012 780,913,657,1011,1144,1460,933,1782,1660,1623,1287,1859,2432,2409,
%U A363012 1629,3237,3000,2663,2049,3421,4056,3279,2739,3611,4380,5850,3033,4323,5632,6090,4380
%N A363012 a(n) = Sum_{d|n} d*tau(d)*phi(d)*mu(n/d).
%C A363012 Möbius transform of n*tau(n)*phi(n).
%H A363012 Amiram Eldar, <a href="/A363012/b363012.txt">Table of n, a(n) for n = 1..10000</a>
%H A363012 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%F A363012 Multiplicative with a(p) = 2*p^2 - 2*p - 1 and a(p^e) = ((p^2 - 1)*e + p^2)*(p - 1)*p^(2*e - 3) for e > 1. - _Amiram Eldar_, May 16 2023
%t A363012 f[p_, e_] := If[e == 1, 2*p^2 - 2*p - 1, ((p^2 - 1)*e + p^2)*(p - 1)*p^(2*e - 3)]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, May 16 2023 *)
%o A363012 (PARI) a(n) = sumdiv(n, d, d*numdiv(d)*eulerphi(d)*moebius(n/d)); \\ _Michel Marcus_, May 13 2023
%Y A363012 Cf. A000005 (tau), A000010 (phi), A008683 (mu), A359954.
%K A363012 easy,nonn,mult
%O A363012 1,2
%A A363012 _Wesley Ivan Hurt_, May 12 2023