cp's OEIS Frontend

A329646 Inverse Möbius transform of A329643.

%I A329646 #13 Nov 22 2019 18:54:39
%S A329646 0,0,0,1,0,2,0,3,1,2,0,9,0,2,2,9,0,7,0,10,2,2,0,27,1,2,1,21,0,17,0,15,
%T A329646 2,2,2,36,0,2,2,36,0,23,0,23,5,2,0,61,1,4,2,51,0,23,2,51,2,2,0,70,0,2,
%U A329646 0,45,2,42,0,87,2,25,0,90,0,2,1,261,2,44,0,70,5,2,0,117,2,2,2,97,0,55,2,231,2,2,2,143,0,7,17,49,0,100,0,189,3
%N A329646 Inverse Möbius transform of A329643.
%C A329646 a(117) = -9 is the first negative term. Of the first 10000 terms, 1441 are negative and 1233 are zero.
%H A329646 Antti Karttunen, <a href="/A329646/b329646.txt">Table of n, a(n) for n = 1..10000</a> (based on Hans Havermann's factorization of A156552)
%H A329646 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A329646 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A329646 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A329646 a(n) = Sum_{d|n} A329643(d).
%F A329646 a(n) = A329645(n) - A323244(n).
%F A329646 For all n, a(A000040(n)) = 0, a(A006881(n)) = 2.
%o A329646 (PARI) A329646(n) = sumdiv(n,d,A329643(d));
%Y A329646 Cf. A006881, A323244, A329643, A329645.
%K A329646 sign
%O A329646 1,6
%A A329646 _Antti Karttunen_, Nov 21 2019