%I #11 Dec 15 2024 15:46:48
%S -1,0,-1,1,-1,1,-1,1,1,1,-1,1,-1,1,1,1,-1,1,-1,1,1,1,-1,1,1,1,1,1,1,1,
%T -1,1,1,1,1,1,-1,1,1,1,-1,1,-1,1,1,1,-1,1,0,1,-1,1,-1,1,-1,1,1,1,-1,1,
%U 1,1,1,1,1,1,1,1,-1,1,1,1,1,1,1,1,1,1,-1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,-1,1,-1,1,-1,1,-1
%N a(n) = -1, 0 or +1 depending on whether A156552(n) is A000120-deficient, -perfect or -abundant: a(n) = sign(A324100(n)).
%C a(n) = -1 if A156552(n) is in A175524, 0 if it is in A175522 and +1 if it is in A175526.
%H Antti Karttunen, <a href="/A324113/b324113.txt">Table of n, a(n) for n = 2..4473</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F a(n) = sign(A324100(n)) = sign(A192895(A156552(n))).
%o (PARI) A324113(n) = sign(A324100(n)); \\ The rest of program given in A324100.
%Y Cf. A156552, A175522, A175524, A175526, A192895, A324100.
%Y Cf. A324101, A324102 (positions of nonnegative and negative terms).
%K sign
%O 2
%A _Antti Karttunen_, Feb 19 2019