login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091196 Smallest abundant divisor of n-th abundant number. 2

%I #7 Aug 30 2019 04:16:54

%S 12,18,20,12,30,12,20,42,12,18,56,12,66,70,12,78,20,12,88,18,12,20,

%T 102,104,12,56,114,12,18,12,138,20,12,30,12,20,18,12,174,88,12,186,12,

%U 196,18,20,12,104,30,12,20,222,56,12,18,12,246,12,258,20,12,18,272,12

%N Smallest abundant divisor of n-th abundant number.

%H Amiram Eldar, <a href="/A091196/b091196.txt">Table of n, a(n) for n = 1..10000</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/AbundantNumber.html">Abundant Number</a>

%t ab = Select[Range[300], DivisorSigma[1, #] > 2 # &]; s = {}; Do[a = ab[[k]]; j = 1; While[! Divisible[a, ab[[j]]], j++]; AppendTo[s, ab[[j]]], {k, 1, Length[ab]}]; s (* _Amiram Eldar_, Aug 30 2019 *)

%Y Cf. A080224, A091191, A005101.

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, Dec 27 2003

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 09:11 EDT 2024. Contains 371964 sequences. (Running on oeis4.)