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 A332713 #16 May 20 2021 10:56:28
%S A332713 1,2,3,4,5,6,7,7,8,10,11,12,13,14,15,13,17,16,19,20,21,22,23,21,22,26,
%T A332713 22,28,29,30,31,24,33,34,35,32,37,38,39,35,41,42,43,44,40,46,47,39,44,
%U A332713 44,51,52,53,44,55,49,57,58,59,60,61,62,56,46,65,66,67,68,69,70
%N A332713 a(n) = Sum_{d|n} phi(d/gcd(d, n/d)).
%H A332713 Vaclav Kotesovec, <a href="/A332713/a332713.jpg">Graph - the asymptotic ratio (1000000 terms)</a>
%F A332713 Dirichlet g.f.: zeta(s) * zeta(2*s) * zeta(s - 1) * Product_{p prime} (1 - p^(-s) + p^(-2*s) - p^(1 - 2*s)).
%F A332713 a(n) = Sum_{d|n} phi(lcm(d, n/d)/d).
%F A332713 a(n) = Sum_{d|n} A010052(n/d) * A055653(d).
%F A332713 Sum_{k=1..n} a(k) ~ c * Pi^6 * n^2 / 1080, where c = A330523 = Product_{primes p} (1 - 1/p^2 - 1/p^3 + 1/p^4) = 0.5358961538283379998085... - _Vaclav Kotesovec_, Feb 22 2020
%F A332713 From _Richard L. Ollerton_, May 10 2021: (Start)
%F A332713 a(n) = Sum_{k=1..n} phi(gcd(n,k)/gcd(gcd(n,k),n/gcd(n,k)))/phi(n/gcd(n,k)).
%F A332713 a(n) = Sum_{k=1..n} phi(n/gcd(n,k)/gcd(gcd(n,k),n/gcd(n,k)))/phi(n/gcd(n,k)).
%F A332713 a(n) = Sum_{k=1..n} phi(lcm(gcd(n,k),n/gcd(n,k))/gcd(n,k))/phi(n/gcd(n,k)).
%F A332713 a(n) = Sum_{k=1..n} phi(lcm(gcd(n,k),n/gcd(n,k))*gcd(n,k)/n)/phi(n/gcd(n,k)).
%F A332713 a(n) = Sum_{k=1..n} A010052(gcd(n,k))*A055653(n/gcd(n,k))/phi(n/gcd(n,k)).
%F A332713 a(n) = Sum_{k=1..n} A010052(n/gcd(n,k))*A055653(gcd(n,k))/phi(n/gcd(n,k)). (End)
%t A332713 Table[Sum[EulerPhi[d/GCD[d, n/d]], {d, Divisors[n]}], {n, 1, 70}]
%t A332713 A055653[n_] := Sum[Boole[GCD[d, n/d] == 1] EulerPhi[d], {d, Divisors[n]}]; a[n_] := Sum[Boole[IntegerQ[(n/d)^(1/2)]] A055653[d], {d, Divisors[n]}]; Table[a[n], {n, 1, 70}]
%o A332713 (PARI) a(n) = sumdiv(n, d, eulerphi(d/gcd(d, n/d))); \\ _Michel Marcus_, Feb 20 2020
%Y A332713 Cf. A000010, A001616, A010052, A046790 (numbers n such that a(n) < n), A055653, A061884, A078779 (fixed points), A332619, A332686, A332712.
%K A332713 nonn,mult
%O A332713 1,2
%A A332713 _Ilya Gutkovskiy_, Feb 20 2020