<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://tcs.nju.edu.cn/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=67.40.215.54</id>
	<title>TCS Wiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://tcs.nju.edu.cn/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=67.40.215.54"/>
	<link rel="alternate" type="text/html" href="https://tcs.nju.edu.cn/wiki/index.php?title=Special:Contributions/67.40.215.54"/>
	<updated>2026-05-26T19:06:33Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.45.3</generator>
	<entry>
		<id>https://tcs.nju.edu.cn/wiki/index.php?title=Odd_abundant_number&amp;diff=7896</id>
		<title>Odd abundant number</title>
		<link rel="alternate" type="text/html" href="https://tcs.nju.edu.cn/wiki/index.php?title=Odd_abundant_number&amp;diff=7896"/>
		<updated>2017-04-25T01:09:02Z</updated>

		<summary type="html">&lt;p&gt;67.40.215.54: I corrected the reference from &amp;#039;the next 12 numbers&amp;#039; to &amp;#039;the next 11 numbers&amp;#039;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;An &#039;&#039;&#039;odd abundant number&#039;&#039;&#039; is an [[odd number]] &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; that its [[sum-of-divisors|sum-of divisors]] greater than the [[double|twice]] of itself. &lt;br /&gt;
==Examples==&lt;br /&gt;
*The first example is 945   (&#039;&#039;[[3 (number)|3]]&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt;× [[5 (number)|5]]× [[7 (number)|7]]&#039;&#039;). Its [[prime number|prime]] [[factor|factors]] are [[3 (number)|3]], [[5 (number)|5]], and [[7 (number)|7]]. The next following eleven odd abundant numbers are&lt;br /&gt;
1575, 2205, 2835, 3465, 4095, 4725, 5355, 5775, 5985, 6435, 6615. &lt;br /&gt;
*Odd abundant numbers below 500000 are in On-Line Encyclopedia of Integer Sequences [http://oeis.org/A005231/b005231.txt, A005231].&lt;br /&gt;
&lt;br /&gt;
==Formulas==&lt;br /&gt;
The following [[formula]]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;945+630n&amp;lt;/math&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=http://ms.appliedprobability.org/data/files/Articles%2038/38-1-2.pdf|title=More Odd Abundant  Sequences|first=|last=|date=2005|website=|publisher=JAY. SCHIFFMAN|accessdate=2017-01-2}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
presents 62 [[abundant number]]s, but it fails if&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;n\le62&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
The second formula&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;3465+2310n&amp;lt;/math&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=http://ms.appliedprobability.org/data/files/Articles%2038/38-1-2.pdf|title=More Odd Abundant  Sequences|first=|last=|date=2005|website=|publisher=JAY. SCHIFFMAN|accessdate=2017-01-26}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
presents 192 [[abundant number]]s, but fails if&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;n\le192&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The [[third]] formula&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;2446903305+1631268870n&amp;lt;/math&amp;gt; &amp;lt;ref&amp;gt;{{Cite web|url=http://ms.appliedprobability.org/data/files/Articles%2038/38-1-2.pdf|title=More Odd Abundant  Sequences|first=|last=|date=2005|website=|publisher=JAY. SCHIFFMAN|accessdate=2017-01-26}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
fails if &amp;lt;math&amp;gt;n\le135939073&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
==Properties== &lt;br /&gt;
 &lt;br /&gt;
* An calculation was given by Iannucci shows how to find the smallest abundant number not divisible by the first &#039;&#039;&#039;&#039;&#039;n&#039;&#039;&#039;&#039;&#039; primes.&lt;br /&gt;
*An abundant number with abundance 1 is called a [[quasiperfect number]], although none have yet been found. A quasiperfect number must be an odd square number having a value above 10&amp;lt;sup&amp;gt;30&amp;lt;sup&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
{{Reflist}}&lt;br /&gt;
  &lt;br /&gt;
{{Math-stub}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Integer sequences]]&lt;/div&gt;</summary>
		<author><name>67.40.215.54</name></author>
	</entry>
</feed>