A060862 a(n) = 0 if n is deficient, 1 if n is abundant, 2 if n is perfect.

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, 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, 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

Offset

1,6

Links

Antti Karttunen, Table of n, a(n) for n = 1..65537

Example

a(6) = 2 because 6 = 1+2+3 and is perfect.
a(10) = 0 because 10 > 1+2+5 and is deficient.
a(12) = 1 because 12 < 1+2+3+4+6 and is abundant.

Mathematica

Table[Sign[DivisorSigma[1, n] - 2*n], {n, 1, 100}] /. {-1 -> 0, 0 -> 2, 1 -> 1} (* Amiram Eldar, Mar 15 2024 *)

Prog

(PARI) A060862(n) = { my(def=((2*n)-sigma(n))); if(def>0, 0, if(def<0, 1, 2)); }; \\ Antti Karttunen, Sep 27 2018

Crossrefs

Cf. A000396, A005100, A005101, A082551, A294934, A294935, A294936, A294937.

Sequence in context: A080225 A122841 A326075 * A325801 A325194 A066087

Adjacent sequences: A060859 A060860 A060861 * A060863 A060864 A060865

Keyword

easy,nonn

Author

Jason Earls, May 04 2001

Extensions

More terms from Erich Friedman, Jun 01 2001

Status

approved