|
%I #18 Mar 15 2024 05:40:26
%S 0,0,0,0,0,2,0,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,1,0,0,0,2,0,1,0,0,0,0,
%T 0,1,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,0,
%U 0,1,0,1,0,0,0,0,0,1,0,1,0,0,0,1,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,1,0,1,0,1,0
%N a(n) = 0 if n is deficient, 1 if n is abundant, 2 if n is perfect.
%H Antti Karttunen, <a href="/A060862/b060862.txt">Table of n, a(n) for n = 1..65537</a>
%e a(6) = 2 because 6 = 1+2+3 and is perfect.
%e a(10) = 0 because 10 > 1+2+5 and is deficient.
%e a(12) = 1 because 12 < 1+2+3+4+6 and is abundant.
%t Table[Sign[DivisorSigma[1, n] - 2*n], {n, 1, 100}] /. {-1 -> 0, 0 -> 2, 1 -> 1} (* _Amiram Eldar_, Mar 15 2024 *)
%o (PARI) A060862(n) = { my(def=((2*n)-sigma(n))); if(def>0,0,if(def<0,1,2)); }; \\ _Antti Karttunen_, Sep 27 2018
%Y Cf. A000396, A005100, A005101, A082551, A294934, A294935, A294936, A294937.
%K easy,nonn
%O 1,6
%A _Jason Earls_, May 04 2001
%E More terms from _Erich Friedman_, Jun 01 2001
|
