The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A088831 Numbers n whose abundance is 2: sigma(n) - 2n = 2. 10
 20, 104, 464, 650, 1952, 130304, 522752, 8382464, 134193152, 549754241024, 8796086730752, 140737463189504, 144115187270549504 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A subset of A045768. If 2^n-3 is prime (n is a term of A050414) then 2^(n-1)*(2^n-3) is in the sequence, this fact is a result of the following interesting theorem that I have found. Theorem: If k is an integer and 2^n-(2k+1) is prime then 2^(n-1)*(2^n-(2k+1)) is a solution of the equation sigma(x)=2(x+k). - Farideh Firoozbakht, Feb 23 2005 Note that the fact " if 2^p-1 is prime then 2^(p-1)*(2^p-1) is a perfect number " is also a trivial result of this theorem. All known terms of this sequence are of the form 2^(n-1)*(2^n-3) where 2^n-3 is prime. Conjecture: There are no term of other forms. So likely next terms of this sequence are: 549754241024,8796086730752,140737463189504,144115187270549504, 2^93*(2^94-3),2^115*(2^116-3),2^121*(2^122-3),2^149*(2^150-3) and etc. - Farideh Firoozbakht, Feb 23 2005 The conjecture in the previous comment is incorrect. The first counterexample is 650, which has factorization 2*5^2*13. - T. D. Noe, May 10 2010 One might call these the "slightly more excessive numbers", by comparison with quasiperfect numbers, called "slightly excessive numbers" by Singh (1997), which are "least" abundant number, i.e., one such that sigma[n]-2n=+1, and for which there are none <10^35. - Jonathan Vos Post, May 01 2011 a(11) > 10^12. - Donovan Johnson, Dec 08 2011 a(12) > 10^13. - Giovanni Resta, Mar 29 2013 a(14) > 10^18. - Hiroaki Yamanouchi, Aug 23 2018 Any term x of this sequence can be combined with any term y of A191363 to satisfy the property (sigma(x)+sigma(y))/(x+y) = 2, which is a necessary (but not sufficient) condition for two numbers to be amicable. - Timothy L. Tiffin, Sep 13 2016 REFERENCES Singh, S. Fermat's Enigma: The Epic Quest to Solve the World's Greatest Mathematical Problem. New York: Walker, p. 13, 1997. 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 P. Hagis, and G. L. Cohen, Some Results Concerning Quasiperfect Numbers, J. Austral. Math. Soc. Ser. A 33, 275-286, 1982. FORMULA Solutions to sigma(x)-2*x = 2. EXAMPLE Abundances of terms in A045768: {-1,2,2,2,2,2,2,2,2,2} so 1 is not here. MATHEMATICA Select[Range[10^6], DivisorSigma[1, #] - 2 # == 2 &] (* Michael De Vlieger, Feb 25 2017 *) PROG (PARI) is(n)=sigma(n)==2*n+2 \\ Charles R Greathouse IV, Feb 21 2017 CROSSREFS Cf. A033880, A045768, A050414, A191363 (deficiency 2). Sequence in context: A220207 A189950 A045768 * A063785 A181703 A187756 Adjacent sequences:  A088828 A088829 A088830 * A088832 A088833 A088834 KEYWORD nonn,more AUTHOR Labos Elemer, Oct 28 2003 EXTENSIONS One more term from Farideh Firoozbakht, Feb 23 2005 Comment and example corrected by T. D. Noe, May 10 2010 a(10) from Donovan Johnson, Dec 08 2011 a(11) from Giovanni Resta, Mar 29 2013 a(12) from Jud McCranie, Jun 18 2017 a(13) from Hiroaki Yamanouchi, Aug 23 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 16 22:46 EST 2020. Contains 331976 sequences. (Running on oeis4.)