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 A349433 #16 Oct 16 2023 04:31:34
%S A349433 2,0,0,1,0,2,0,3,1,4,0,3,0,6,4,7,0,3,0,6,6,10,0,5,4,12,3,9,0,-4,0,15,
%T A349433 10,16,12,5,0,18,12,10,0,-6,0,15,2,22,0,9,9,8,16,18,0,5,20,15,18,28,0,
%U A349433 -4,0,30,3,31,24,-10,0,24,22,-12,0,9,0,36,0,27,30,-12,0,18,7,40,0,-6,32,42,28,25,0,-6,36,33
%N A349433 a(n) = A349431(n) + A349432(n).
%H A349433 Antti Karttunen, <a href="/A349433/b349433.txt">Table of n, a(n) for n = 1..20000</a>
%F A349433 a(1) = 2, and for n >1, a(n) = -Sum_{d|n, 1<d<n} A349431(d) * A349432(n/d). [As the sequences are Dirichlet inverses of each other]
%t A349433 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, # * kinv[n/#] + # * MoebiusMu[#] * k[n/#] &]; Array[a, 100] (* _Amiram Eldar_, Nov 18 2021 *)
%o A349433 (PARI) A349433(n) = (A349431(n) + A349432(n)); \\ Needs also code from A349431 and A349432.
%Y A349433 Cf. A349431, A349432.
%Y A349433 Cf. also A349446.
%K A349433 sign,look
%O A349433 1,1
%A A349433 _Antti Karttunen_, Nov 17 2021