%I A005231
%S A005231 945,1575,2205,2835,3465,4095,4725,5355,5775,5985,6435,6615,6825,7245,
%T A005231 7425,7875,8085,8415,8505,8925,9135,9555,9765,10395,11025,11655,12285,
%U A005231 12705,12915,13545,14175,14805,15015,15435,16065,16695,17325,17955
%N A005231 Odd abundant numbers.
%D A005231 L. E. Dickson, Amer. J. Math., 35 (1913), 413-426.
%D A005231 W. Dunham, Euler: The Master of Us All, The Mathematical Association 
               of America Inc., Washington, D.C., 1999, p. 13.
%D A005231 R. K. Guy, Unsolved Problems in Number Theory, B2.
%H A005231 T. D. Noe, <a href="b005231.txt">Table of n, a(n) for n=1..1000</a>
%H A005231 Walter Nissen, <a href="http://upforthecount.com/math/abundance.html">
               Abundancy : Some Resources </a>
%H A005231 Jill Britton, <a href="http://britton.disted.camosun.bc.ca/perfect/jbperfect.htm">
               Perfect Number Analyzer</a>.
%o A005231 (PARI) je=[ ]; forstep(n=1,15000,2,x=sigma(n); if(x>(2*n),je=concat(je,
               n))); je
%Y A005231 Cf. A006038, A005101, A064001.
%Y A005231 Sequence in context: A133814 A104438 A125013 this_sequence A006038 A127667 
               A109729
%Y A005231 Adjacent sequences: A005228 A005229 A005230 this_sequence A005232 A005233 
               A005234
%K A005231 nonn
%O A005231 1,1
%A A005231 N. J. A. Sloane (njas(AT)research.att.com).
%E A005231 More terms from James A. Sellers (sellersj(AT)math.psu.edu)