login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A082551
Denote sigma(n)-n by s(n); a(n)=1 if s(n)>n, a(n)=0 if s(n)=n, a(n)=-1 if s(n)<n.
2
-1, -1, -1, -1, -1, 0, -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, -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
OFFSET
1,1
LINKS
FORMULA
a(n) = sign(A033880(n)).
MAPLE
A082551 := proc(n)
signum( numtheory[sigma](n)-2*n) ;
end proc: # R. J. Mathar, Sep 28 2011
MATHEMATICA
Table[Sign[DivisorSigma[1, n] - 2*n], {n, 1, 100}] (* Amiram Eldar, Mar 15 2024 *)
PROG
(PARI) A082551(n) = sign(sigma(n)-(2*n)); \\ Antti Karttunen, Sep 28 2018
KEYWORD
easy,sign
AUTHOR
Hanoch M. bin (hanochb(AT)shiron.com), May 12 2003
STATUS
approved