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 A349446 #10 Nov 21 2021 01:19:53
%S A349446 2,0,0,1,0,-2,0,1,1,-4,0,-1,0,-6,4,1,0,-5,0,-2,6,-10,0,-1,4,-12,5,-3,
%T A349446 0,-4,0,1,10,-16,12,-2,0,-18,12,-2,0,-6,0,-5,14,-22,0,-1,9,-16,16,-6,
%U A349446 0,-13,20,-3,18,-28,0,0,0,-30,21,1,24,-10,0,-8,22,-12,0,-2,0,-36,24,-9,30,-12,0,-2,19,-40,0,0,32
%N A349446 a(n) = A349444(n) + A349445(n).
%H A349446 Antti Karttunen, <a href="/A349446/b349446.txt">Table of n, a(n) for n = 1..20000</a>
%F A349446 a(1) = 2, and for n > 1, a(n) = -Sum_{d|n, 1<d<n} A349444(d) * A349445(n/d). [As the sequences are Dirichlet inverses of each other]
%t A349446 s[n_] := MoebiusMu[n] - If[OddQ[n], 0, MoebiusMu[n/2]]; k[n_] := (n / 2^IntegerExponent[n, 2] + 1)/2; k[n_] := (n / 2^IntegerExponent[n, 2] + 1)/2; kinv[1] = 1; kinv[n_] := kinv[n] = -DivisorSum[n, kinv[#]*k[n/#] &, # < n &]; a[n_] := DivisorSum[n, s[#]*k[n/#] + IntegerExponent[2*#, 2]*kinv[n/#] &]; Array[a, 100] (* _Amiram Eldar_, Nov 19 2021 *)
%o A349446 (PARI) A349446(n) = (A349444(n)+A349445(n)); \\ Needs also code from A349444 and A349445.
%Y A349446 Cf. A349444, A349445.
%Y A349446 Cf. also A349433.
%K A349446 sign
%O A349446 1,1
%A A349446 _Antti Karttunen_, Nov 18 2021