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 A069193 #23 Sep 21 2023 01:45:33
%S A069193 1,3,5,10,9,15,13,28,24,27,21,50,25,39,45,72,33,72,37,90,65,63,45,140,
%T A069193 70,75,99,130,57,135,61,176,105,99,117,240,73,111,125,252,81,195,85,
%U A069193 210,216,135,93,360,140,210,165,250,105,297,189,364,185,171,117,450
%N A069193 a(n) = Sum_{d|n} d*phi(n)/phi(d).
%H A069193 Amiram Eldar, <a href="/A069193/b069193.txt">Table of n, a(n) for n = 1..10000</a>
%F A069193 Multiplicative with a(p^e) = ((e+1)*p - 1) * p^(e-1). - _Amiram Eldar_, Sep 15 2019
%F A069193 a(n) = Sum_{k=1..n, gcd(n,k) = 1} sigma(gcd(n,k-1)). - _Ilya Gutkovskiy_, Sep 24 2021
%F A069193 Dirichlet g.f.: zeta(s-1)^2 * Product_{p prime} (1 - 1/p^s + 1/p^(2*s-1)). - _Amiram Eldar_, Sep 21 2023
%p A069193 with(numtheory):for n from 1 to 200 do di := sort(convert(divisors(n),list)): a[n] := sum(di[i]*phi(n)/phi(di[i]),i=1..nops(di)):od:seq(a[k],k=1..200);
%t A069193 f[p_, e_] := ((e+1)*p - 1) * p^(e-1) ; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100] (* _Amiram Eldar_, Sep 15 2019 *)
%o A069193 (PARI) a(n) = sumdiv(n, d, d*eulerphi(n)/eulerphi(d)); \\ _Michel Marcus_, Sep 15 2019
%o A069193 (Magma) [&+[d*EulerPhi(n) div EulerPhi(d):d in Divisors(n)]:n in [1..60]]; // _Marius A. Burtea_, Sep 15 2019
%Y A069193 Cf. A000010.
%K A069193 mult,easy,nonn
%O A069193 1,2
%A A069193 _Vladeta Jovovic_, Apr 10 2002
%E A069193 More terms from _Sascha Kurz_, Feb 02 2003