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 A332684 #7 Feb 21 2020 10:02:38
%S A332684 1,1,3,3,8,2,14,7,14,5,27,6,35,7,19,18,50,5,58,16,32,14,74,14,68,15,
%T A332684 54,29,101,3,111,39,59,21,83,26,140,24,70,39,158,6,168,51,74,32,186,
%U A332684 29,170,20,101,66,217,17,157,64,117,39,247,28,261,39,121,92,194
%N A332684 a(n) = Sum_{k=1..n} mu(gcd(n, k)) * floor(n/k).
%C A332684 Moebius transform of A116477.
%C A332684 Moebius transform applied twice to A006218.
%F A332684 a(n) = Sum_{d|n} mu(n/d) * A116477(d).
%F A332684 a(n) = Sum_{d|n} A007427(n/d) * A006218(d).
%t A332684 Table[Sum[MoebiusMu[GCD[n, k]] Floor[n/k], {k, 1, n}], {n, 1, 65}]
%t A332684 A007427[n_] := Sum[MoebiusMu[n/d] MoebiusMu[d], {d, Divisors[n]}]; A006218[n_] := Sum[DivisorSigma[0, k], {k, 1, n}]; Table[Sum[A007427[n/d] A006218[d], {d, Divisors[n]}], {n, 1, 65}]
%o A332684 (PARI) a(n) = sum(k=1, n, moebius(gcd(n, k))*(n\k)); \\ _Michel Marcus_, Feb 21 2020
%Y A332684 Cf. A006218, A007427, A008683, A116477.
%K A332684 nonn
%O A332684 1,3
%A A332684 _Ilya Gutkovskiy_, Feb 19 2020