|
%I #28 Apr 11 2021 23:38:51
%S 81081,153153,171171,189189,207207,223839,243243,261261,279279,297297,
%T 351351,459459,513513,567567,621621,671517,729729,742203,783783,
%U 793611,812889,837837,891891,908523,960687,999999,1024947,1054053,1072071
%N Odd abundant numbers not divisible by 5.
%C Or, odd abundant numbers that do not end in 5.
%C All terms below 2000000 are divisible by 21 (so by 3). Moreover, except for a few, most are divisible by 231. - _Labos Elemer_, Sep 15 2005
%C An odd abundant number (see A005231) not divisible by 3 nor 5 must have at least 15 distinct prime factors (e.g., 61#/5#*7^2*11*13*17, where # is primorial) and be >= 67#/5#*77 = A047802(3) ~ 2.0*10^25. -- The smallest non-primitive abundant number (cf. A006038) in this sequence is 7*a(1) = 567567 = a(14). - _M. F. Hasler_, Jul 27 2016
%D David Wells, The Penguin Dictionary of Curious and Interesting Numbers, p. 169 (Rev. ed. 1997).
%H David A. Corneth, <a href="/A064001/b064001.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Harry J. Smith)
%H Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_329.htm">Puzzle 329. Odd abundant numbers not divided by 2 or 3</a>, The Prime Puzzles and Problems Connection.
%H Jay L. Schiffman, <a href="http://www.rowan.edu/colleges/csm/departments/math/facultystaff/schiffman/Odd%20Abundant%20Numbers.pdf">Odd Abundant Numbers</a>, Mathematical Spectrum, Volume 37, Number 2 (January 2005), pp 73-75.
%t Select[ Range[ 1, 10^6, 2 ], DivisorSigma[ 1, # ] - 2# > 0 && Mod[ #, 5 ] != 0 & ]
%t ta={{0}};Do[g=n;s=DivisorSigma[1, n]-2*n; If[Greater[s, 0]&&!Equal[Mod[n, 2], 0]&& !Equal[Mod[n, 5], 0], Print[n];ta=Append[ta, n]], {n, 1, 2000000}] ta=Delete[ta, 1] (* _Labos Elemer_, Sep 15 2005 *)
%o (PARI) { n=0; forstep (m=1, 10^9, 2, if (m%5 && sigma(m) > 2*m, write("b064001.txt", n++, " ", m); if (n==1000, break)) ) } \\ _Harry J. Smith_, Sep 05 2009
%Y Cf. A005231, A110585.
%K nonn
%O 1,1
%A _Harvey P. Dale_, Sep 17 2001
%E More terms from _Robert G. Wilson v_, Sep 28 2001
%E Further terms from _Labos Elemer_, Sep 15 2005
%E Entry revised by _N. J. A. Sloane_, Mar 28 2006
|
