login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A033880 Abundance of n, or (sum of divisors of n) - 2n. 21
-1, -1, -2, -1, -4, 0, -6, -1, -5, -2, -10, 4, -12, -4, -6, -1, -16, 3, -18, 2, -10, -8, -22, 12, -19, -10, -14, 0, -28, 12, -30, -1, -18, -14, -22, 19, -36, -16, -22, 10, -40, 12, -42, -4, -12, -20, -46, 28, -41, -7, -30, -6, -52, 12, -38, 8, -34, -26, -58, 48, -60, -28, -22 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

For no known n is a(n) = 1.  If there is such an n it must be greater than 10^35 and have seven or more distinct prime factors (Hagis and Cohen 1982) [Jonathan Vos Post, May 1, 2011].

REFERENCES

Hagis, P.; and Cohen, G. L. "Some Results Concerning Quasiperfect Numbers." J. Austral. Math. Soc. Ser. A 33, 275-286, 1982.

Guy, R. K. "Almost Perfect, Quasi-Perfect, Pseudoperfect, Harmonic, Weird, Multiperfect and Hyperperfect Numbers." §B2 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 45-53, 1994.

LINKS

J. G. Wurtzel, Table of n, a(n) for n=1..10000 [This replaces an earlier b-file computed by T. D. Noe]

Eric Weisstein's World of Mathematics, Abundance

Eric Weisstein's World of Mathematics, Quasiperfect Number

FORMULA

a(n) = A000203(n)-A005843(n). [From Omar E. Pol, Dec 14 2008]

MAPLE

with(numtheory); n->sigma(n) - 2*n;

MATHEMATICA

Array[Total[Divisors[#]]-2#&, 70] (* From Harvey P. Dale, Sep 16 2011 *)

CROSSREFS

Equals -A033879. Cf. A005100.

Sequence in context: A120112 A103977 A109883 * A033879 A033883 A106316

Adjacent sequences:  A033877 A033878 A033879 * A033881 A033882 A033883

KEYWORD

sign,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Definition corrected Jul 04 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 07:12 EST 2012. Contains 205697 sequences.