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 A346612 #16 Nov 18 2022 08:30:48
%S A346612 1,1,2,0,4,2,6,2,0,4,10,0,12,6,8,0,16,0,18,0,12,10,22,4,0,12,6,0,28,8,
%T A346612 30,4,20,16,24,0,36,18,24,8,40,12,42,0,0,22,46,0,0,0,32,0,52,6,40,12,
%U A346612 36,28,58,0,60,30,0,0,48,20,66,0,44,24,70,0,72,36,0,0,60,24,78,0,0
%N A346612 Moebius transform of A019554.
%H A346612 Amiram Eldar, <a href="/A346612/b346612.txt">Table of n, a(n) for n = 1..10000</a>
%H A346612 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>.
%F A346612 Multiplicative with a(p^e) = 0 if e is even, and p^((e+1)/2) - p^((e-1)/2) if e is odd. - _Amiram Eldar_, Aug 19 2021
%F A346612 Sum_{k=1..n} a(k) ~ c * n^2, where c = 18*zeta(3)/Pi^4 = 0.222125... . - _Amiram Eldar_, Nov 18 2022
%t A346612 f[p_, e_] := If[EvenQ[e], 0, p^((e + 1)/2) - p^((e - 1)/2)]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Aug 19 2021 *)
%o A346612 (PARI) a(n) = sumdiv(n, d, moebius(n/d)*d/core(d, 1)[2]); \\ _Michel Marcus_, Aug 18 2021
%Y A346612 Cf. A002117, A019554, A346613.
%K A346612 nonn,mult,easy
%O A346612 1,3
%A A346612 _N. J. A. Sloane_, Aug 18 2021