This site is supported by donations to The OEIS Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005231 Odd abundant numbers (odd numbers n whose sum of divisors exceeds 2n). 48


%S 945,1575,2205,2835,3465,4095,4725,5355,5775,5985,6435,6615,6825,7245,

%T 7425,7875,8085,8415,8505,8925,9135,9555,9765,10395,11025,11655,12285,

%U 12705,12915,13545,14175,14805,15015,15435,16065,16695,17325,17955

%N Odd abundant numbers (odd numbers n whose sum of divisors exceeds 2n).

%C While the first even abundant number is 12 = 2^2*3, the first odd abundant is 945 = 3^3*5*7, the 232nd abundant number.

%C Schiffman notes that 945+630k is in this sequence for all k < 52. Most of the first initial terms are of the form. Among the 1996 terms below 10^6, 1164 terms are of that form, and only 26 terms are not divisible by 5, cf. A064001. - _M. F. Hasler_, Jul 16 2016

%C From _M. F. Hasler_, Jul 28 2016: (Start)

%C Any multiple of an abundant number is again abundant, see A006038 for primitive terms, i.e., those which are not a multiple of an earlier term.

%C An odd abundant number must have at least 3 distinct prime factors, and 5 prime factors when counted with multiplicity (A001222), whence a(1) = 3^3*5*7. To see this, write the relative abundancy A(N) = sigma(N)/N = sigma[-1](N) as A(Product p_i^e_i) = Product (p_i-1/p_i^e_i)/(p_i-1) < Product p_i/(p_i-1).

%C See A115414 for terms not divisible by 3, A064001 for terms not divisible by 5, A112640 for terms coprime to 5*7, and A047802 for other generalizations.

%C As of today, we don't know a difference between this set S of odd abundant numbers and the set S' of odd semiperfect numbers: Elements of S' \ S would be perfect (A000396), and elements of S \ S' would be weird (A006037), but no odd weird or perfect number is known. (End)

%D W. Dunham, Euler: The Master of Us All, The Mathematical Association of America Inc., Washington, D.C., 1999, p. 13.

%D R. K. Guy, Unsolved Problems in Number Theory, B2.

%H T. D. Noe, <a href="/A005231/b005231.txt">Table of n, a(n) for n=1..1000</a>

%H Jill Britton, <a href="http://britton.disted.camosun.bc.ca/perfect/jbperfect.htm">Perfect Number Analyzer</a>.

%H L. E. Dickson, <a href="http://www.jstor.org/stable/2370405">Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors</a>, American Journal of Mathematics 35 (1913), pp. 413-422.

%H Victor Meally, <a href="/A006556/a006556.pdf">Letter to N. J. A. Sloane</a>, no date.

%H Walter Nissen, <a href="http://upforthecount.com/math/abundance.html">Abundancy : Some Resources</a>

%H Jay L. Schiffman, <a href="https://academics.rowan.edu/csm/departments/math/facultystaff/faculty/schiffman/Odd%20Abundant%20Numbers.pdf">Odd Abundant Numbers</a>, Mathematical Spectrum, Volume 37, Number 2 (January 2005), pp 73-75.

%H Jay L. Schiffman and Christopher S. Simons, <a href="https://academics.rowan.edu/csm/departments/math/facultystaff/faculty/schiffman/More%20Odd%20Abundant%20Seq.pdf">More Odd Abundant Sequences</a>, Volume 38, Number 1 (September 2005), pp. 7-8.

%p A005231 := proc(n) option remember ; local a ; if n = 1 then 945 ; else for a from procname(n-1)+2 by 2 do if numtheory[sigma](a) > 2*a then return a; end if; end do: end if; end proc: # _R. J. Mathar_, Mar 20 2011

%t fQ[n_] := DivisorSigma[1, n] > 2n; Select[1 + 2Range@ 9000, fQ] (* _Robert G. Wilson v_, Mar 20 2011 *)

%o (PARI) je=[]; forstep(n=1,15000,2, if(sigma(n)>2*n, je=concat(je,n))); je

%o (PARI) is_A005231(n)={bittest(n,0)&&sigma(n)>2*n} \\ _M. F. Hasler_, Jul 28 2016

%Y Cf. A005835, A006038, A115414, A064001, A112640, A122036, A136446, A005101, A173490, A039725.

%K nonn

%O 1,1

%A _N. J. A. Sloane_

%E More terms from _James A. Sellers_

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 22:03 EDT 2019. Contains 328211 sequences. (Running on oeis4.)