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 A329639 #12 Nov 22 2019 18:53:40
%S A329639 0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,5,0,0,0,5,0,1,0,0,0,0,0,0,0,
%T A329639 4,5,0,0,14,0,0,5,0,0,1,0,0,0,13,5,0,0,0,1,21,0,14,0,0,0,0,0,6,8,0,0,
%U A329639 0,0,0,4,0,5,0,0,5,0,12,14,0,0,17,0,0,26,74,0,350,40,0,14,53,0,0,0,70,0,0,13,18,7,0,0,0,0,15
%N A329639 Sum of -A329644(d) for all such divisors d of n for which A329644(d) < 0. Here A329644 is the Möbius transform of A323244, the deficiency of A156552(n).
%H A329639 Antti Karttunen, <a href="/A329639/b329639.txt">Table of n, a(n) for n = 1..10000</a> (based on Hans Havermann's factorization of A156552)
%H A329639 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A329639 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A329639 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A329639 a(n) = -Sum_{d|n} [A329644(d) < 0] * A329644(d), where [ ] is Iverson bracket.
%F A329639 a(n) = A329638(n) - A323244(n).
%o A329639 (PARI) A329639(n) = sumdiv(n,d,if((d=A329644(d))<0,-d,0));
%Y A329639 Cf. A323244, A329638, A329640, A329641, A329644.
%Y A329639 Cf. also A318879.
%K A329639 nonn
%O A329639 1,21
%A A329639 _Antti Karttunen_, Nov 21 2019