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 A332730 #9 Dec 05 2022 04:46:20
%S A332730 1,3,3,5,3,9,3,8,5,9,3,15,3,9,9,11,3,15,3,15,9,9,3,24,5,9,8,15,3,27,3,
%T A332730 15,9,9,9,25,3,9,9,24,3,27,3,15,15,9,3,33,5,15,9,15,3,24,9,24,9,9,3,
%U A332730 45,3,9,15,19,9,27,3,15,9,27,3,40,3,9,15
%N A332730 a(n) = Sum_{d|n} tau(d/gcd(d, n/d)), where tau = A000005.
%C A332730 Inverse Moebius transform of A322483.
%H A332730 Amiram Eldar, <a href="/A332730/b332730.txt">Table of n, a(n) for n = 1..10000</a>
%F A332730 a(n) = Sum_{d|n} A322483(d).
%F A332730 a(n) = Sum_{d|n} tau(n/d) * A295316(d).
%F A332730 Multiplicative with a(p^e) = floor((e+1)*(e+5)/4) = A024206(e+2). - _Amiram Eldar_, Dec 05 2022
%t A332730 Table[Sum[DivisorSigma[0, d/GCD[d, n/d]], {d, Divisors[n]}], {n, 1, 75}]
%t A332730 f[p_, e_] := Floor[(e+3)/2]; A322483[n_] := If[n==1, 1, Times @@ (f @@@ FactorInteger[n])]; Table[Sum[A322483[d], {d, Divisors[n]}], {n, 1, 75}]
%t A332730 f[p_, e_] := Floor[(e + 1)*(e + 5)/4]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Dec 05 2022 *)
%Y A332730 Cf. A000005, A007425, A024206, A048691, A124315, A124316, A295316, A322483, A332619, A332713.
%K A332730 nonn,mult
%O A332730 1,2
%A A332730 _Ilya Gutkovskiy_, Feb 21 2020