A023199 -id:A023199 - cp's OEIS frontend

A004394 Superabundant [or super-abundant] numbers: n such that sigma(n)/n > sigma(m)/m for all m < n, sigma(n) being A000203(n), the sum of the divisors of n.

1, 2, 4, 6, 12, 24, 36, 48, 60, 120, 180, 240, 360, 720, 840, 1260, 1680, 2520, 5040, 10080, 15120, 25200, 27720, 55440, 110880, 166320, 277200, 332640, 554400, 665280, 720720, 1441440, 2162160, 3603600, 4324320, 7207200, 8648640, 10810800, 21621600

Offset: 1

Matthew Conroy

Matthew Conroy points out that these are different from the highly composite numbers - see A002182. Jul 10 1996
With respect to the comment above, neither sequence is subsequence of the other. - Ivan N. Ianakiev, Feb 11 2020
Also n such that sigma_{-1}(n) > sigma_{-1}(m) for all m < n, where sigma_{-1}(n) is the sum of the reciprocals of the divisors of n. - Matthew Vandermast, Jun 09 2004
Ramanujan (1997, Section 59; written in 1915) called these numbers "generalized highly composite." Alaoglu and Erdős (1944) changed the terminology to "superabundant." - Jonathan Sondow, Jul 11 2011
Alaoglu and Erdős show that: (1) n is superabundant => n=2^{e_2} * 3^{e_3} * ...* p^{e_p}, with e_2 >= e_3 >= ... >= e_p (and e_p is 1 unless n=4 or n=36); (2) if q < r are primes, then | e_r - floor(e_q*log(q)/log(r)) | <= 1; (3) q^{e_q} < 2^{e_2+2} for primes q, 2 < q <= p. - Keith Briggs, Apr 26 2005
It follows from Alaoglu and Erdős finding 1 (above) that, for n > 7, a(n) is a Zumkeller Number (A083207); for details, see Proposition 9 and Corollary 5 at Rao/Peng link (below). - Ivan N. Ianakiev, Feb 11 2020
See A166735 for superabundant numbers that are not highly composite, and A189228 for superabundant numbers that are not colossally abundant.
Pillai called these numbers "highly abundant numbers of the 1st order". - Amiram Eldar, Jun 30 2019

R. Honsberger, Mathematical Gems, M.A.A., 1973, p. 112.
J. Sandor, "Abundant numbers", In: M. Hazewinkel, Encyclopedia of Mathematics, Supplement III, Kluwer Acad. Publ., 2002 (see pp. 19-21).
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 147.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, 128.

D. Kilminster, Table of n, a(n) for n = 1..2000 (extends to n = 8436 in the comments; first 500 terms from T. D. Noe)
A. Akbary and Z. Friggstad, Superabundant numbers and the Riemann hypothesis, Amer. Math. Monthly, 116 (2009), 273-275.
L. Alaoglu and P. Erdős, On highly composite and similar numbers, Trans. Amer. Math. Soc., 56 (1944), 448-469. Errata.
Christian Axler, Inequalities involving the primorial counting function, arXiv:2406.04018 [math.NT], 2024. See p. 12.
Yu. Bilu, P. Habegger, and L. Kühne, Effective bounds for singular units, arXiv:1805.07167 [math.NT], 2018.
Benjamin Braun and Brian Davis, Antichain Simplices, arXiv:1901.01417 [math.CO], 2019.
Keith Briggs, Abundant numbers and the Riemann Hypothesis, Experimental Math., Vol. 16 (2006), p. 251-256.
Tibor Burdette and Ian Stewart, Counterexamples to a Conjecture by Alaoglu and Erdős, arXiv:2009.03306 [math.NT], 2020.
Geoffrey Caveney, Jean-Louis Nicolas and Jonathan Sondow, Robin's theorem, primes, and a new elementary reformulation of the Riemann Hypothesis, INTEGERS 11 (2011), #A33.
Geoffrey Caveney, J.-L. Nicolas and J. Sondow, On SA, CA, and GA numbers, arXiv preprint arXiv:1112.6010 [math.NT], 2011. - From _N. J. A. Sloane_, Apr 14 2012
Geoffrey Caveney, J.-L. Nicolas and J. Sondow, On SA, CA, and GA numbers, Ramanujan J., 29 (2012), 359-384.
François Clément and Stefan Steinerberger, On the largest singular vector of the Redheffer matrix, arXiv:2502.09489 [math.NT], 2025. See p. 2.
P. Erdős and J.-L. Nicolas, Répartition des nombres superabondants (Text in French), Bulletin de la S. M. F., tome 103 (1975), pp. 65-90.
F. Jokar, On k-layered numbers and some labeling related to k-layered numbers, arXiv:2003.11309 [math.NT], 2020.
Stepan Kochemazov, Oleg Zaikin, Eduard Vatutin, and Alexey Belyshev, Enumerating Diagonal Latin Squares of Order Up to 9, J. Int. Seq., Vol. 23 (2020), Article 20.1.2.
J. C. Lagarias, An elementary problem equivalent to the Riemann hypothesis, Am. Math. Monthly 109 (#6, 2002), 534-543.
A. Morkotun, On the increase of Gronwall function value at the multiplication of its argument by a prime, arXiv preprint arXiv:1307.0083 [math.NT], 2013.
S. Nazardonyavi and S. Yakubovich, Superabundant numbers, their subsequences and the Riemann hypothesis, arXiv preprint arXiv:1211.2147 [math.NT], 2012.
S. Nazardonyavi and S. Yakubovich, Delicacy of the Riemann hypothesis and certain subsequences of superabundant numbers, arXiv preprint arXiv:1306.3434 [math.NT], 2013.
S. Nazardonyavi and S. Yakubovich, Extremely Abundant Numbers and the Riemann Hypothesis, Journal of Integer Sequences, 17 (2014), Article 14.2.8.
Walter Nissen, Abundancy : Some Resources.
T. D. Noe, First 500 superabundant numbers.
T. D. Noe, First 1000000 superabundant numbers (21 MB, zipped).
S. Sivasankaranarayana Pillai, Highly abundant numbers, Bulletin of the Calcutta Mathematical Society, Vol. 35, No. 1 (1943), pp. 141-156.
S. Sivasankaranarayana Pillai, On numbers analogous to highly composite numbers of Ramanujan, Rajah Sir Annamalai Chettiar Commemoration Volume, ed. Dr. B. V. Narayanaswamy Naidu, Annamalai University, 1941, pp. 697-704.
S. Ramanujan, Highly composite numbers, Annotated and with a foreword by J.-L. Nicolas and G. Robin, Ramanujan J., 1 (1997), 119-153.
K. P. S. Bhaskara Rao and Yuejian Peng, On Zumkeller Numbers, Journal of Number Theory, Volume 133, Issue 4, April 2013, pp. 1135-1155.
T. Schwabhäuser, Preventing Exceptions to Robin's Inequality, arXiv preprint arXiv:1308.3678 [math.NT], 2013.
Eric Weisstein's World of Mathematics, Superabundant Number.
Wikipedia, Superabundant number.

Almost the same as A077006.
The colossally abundant numbers A004490 are a subsequence, as are A023199.
Subsequence of A025487; apart from a(3) = 4 and a(7) = 36, a subsequence of A102750.
Cf. A000203, A002093, A002182.
Cf. A112974 (number of superabundant numbers between colossally abundant numbers).
Cf. A091901 (Robin's inequality), A189686 (superabundant and the reverse of Robin's inequality), A192884 (non-superabundant and the reverse of Robin's inequality).

a=0; Do[b=DivisorSigma[1, n]/n; If[b>a, a=b; Print[n]], {n, 1, 10^7}]
(* Second program: convert all 8436 terms in b-file into a list of terms: *)
f[w_] := Times @@ Flatten@ {Complement[#1, Union[#2, #3]], Product[Prime@ i, {i, PrimePi@ #}] & /@ #2, Factorial /@ #3} & @@ ToExpression@ {StringSplit[w, ?(! DigitQ@ # &)], StringCases[w, (x : DigitCharacter ..) ~~ "#" :> x], StringCases[w, (x : DigitCharacter ..) ~~ "!" :> x]}; Map[Which[StringTake[#, 1] == {"#"}, f@ Last@ StringSplit@ Last@ #, StringTake[#, 1] == {}, Nothing, True, ToExpression@ StringSplit[#][[1, -1]]] &, Drop[Import["b004394.txt", "Data"], 3] ] (* _Michael De Vlieger, May 08 2018 *)

print1(r=1);forstep(n=2,1e6,2,t=sigma(n,-1);if(t>r,r=t;print1(", "n))) \\ Charles R Greathouse IV, Jul 19 2011

a(n+1) <= 2*a(n). - A.H.M. Smeets, Jul 10 2021

Name edited by Peter Munn, Mar 13 2019

A119240 Least odd number k such that sigma(k)/k >= n.

Original entry on oeis.org

1, 945, 1018976683725, 1853070540093840001956842537745897243375

Offset: 1

T. D. Noe, May 09 2006

nonn

These numbers are a subset of the oddly superabundant numbers, A119239. Laatsch mentions a(3). Pettigrew computes a(4) and a(5), the latter being a 123-digit number.

Pettigrew (link, Tableau 5, p. 21) gives a(5) as 3^6*5^4*7^3*11^2*13^2*17^2*19*...*277. - Jeppe Stig Nielsen, Jul 03 2017

Jeppe Stig Nielsen, Table of n, a(n) for n = 1..5
Richard Laatsch, Measuring the abundancy of integers, Mathematics Magazine 59 (2) (1986) 84-92.
Walter Nissen, Abundancy : Some Resources
Steve Pettigrew, Sur la distribution de nombres spéciaux consécutifs, M.Sc. Thesis, Univ. Laval, 2000.

Cf. A023199 (least number k such that sigma(k)/k >= n).

A103288 Numbers k such that sigma(k) >= 2k-1 (union of perfect, abundant and least deficient numbers).

Original entry on oeis.org

1, 2, 4, 6, 8, 12, 16, 18, 20, 24, 28, 30, 32, 36, 40, 42, 48, 54, 56, 60, 64, 66, 70, 72, 78, 80, 84, 88, 90, 96, 100, 102, 104, 108, 112, 114, 120, 126, 128, 132, 138, 140, 144, 150, 156, 160, 162, 168, 174, 176, 180, 186, 192, 196, 198, 200, 204, 208, 210, 216, 220

Offset: 1

Max Alekseyev, Jan 28 2005

nonn

If the only least deficient numbers are the powers of 2 (open problem) then this sequence is the union of A023196 and A000079.

Like the abundant numbers, this sequence has density between 0.2474 and 0.2480, see A005101. - Charles R Greathouse IV, Nov 30 2022

Paolo Xausa, Table of n, a(n) for n = 1..10000 (terms 1..1000 from T. D. Noe)

Cf. A023196, A023197, A023198, A023199, A000079, A004125.

Select[Range[500], DivisorSigma[1, #] >= 2*# - 1 &] (* Paolo Xausa, Dec 09 2024 *)

for(n=1,1000,if(sigma(n)>=2*n-1,print(n)));

Numbers k such that A004125(k) <= A004125(k-1).

A005579 a(n) = smallest number k such that Product_{i=1..k} prime(i)/(prime(i)-1) > n.

Original entry on oeis.org

0, 1, 2, 3, 4, 6, 9, 14, 22, 35, 55, 89, 142, 230, 373, 609, 996, 1637, 2698, 4461, 7398, 12301, 20503, 34253, 57348, 96198, 161659, 272124, 458789, 774616, 1309627, 2216968, 3757384, 6375166, 10828012, 18409028, 31326514, 53354259, 90945529, 155142139

Offset: 0

N. J. A. Sloane, R. K. Guy

nonn

Laatsch (1986) proved that for n >= 2, a(n) gives the smallest number of distinct prime factors in even numbers having an abundancy index > n.
The abundancy index of a number k is sigma(k)/k. - T. D. Noe, May 08 2006
The first differences of this sequence, A005347, begin the same as the Fibonacci sequence A000045. - T. D. Noe, May 08 2006
Equal to A256968 except for n = 2 and n = 3.  See comment in A256968. - Chai Wah Wu, Apr 17 2015

			The products Product_{i=1..k} prime(i)/(prime(i)-1) for k >= 0 start with 1, 2, 3, 15/4, 35/8, 77/16, 1001/192, 17017/3072, 323323/55296, 676039/110592, 2800733/442368, 86822723/13271040, 3212440751/477757440, 131710070791/19110297600, 5663533044013/802632499200, ... = A060753/A038110. So a(3) = 3.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Amiram Eldar, Table of n, a(n) for n = 0..44
Richard K. Guy, Letter to N. J. A. Sloane, 1988-04-12 (annotated scanned copy).
Richard K. Guy and N. J. A. Sloane, Correspondence, 1988.
Richard Laatsch, Measuring the abundancy of integers, Mathematics Magazine 59 (2) (1986) 84-92.
Popular Computing (Calabasas, CA), Problem 182 (Suggested by Victor Meally), Annotated and scanned copy of page 10 of Vol. 5 (No. 53, Aug 1977).

A001611 is similar but strictly different.

Cf. A000720, A001611, A005580, A060753, A023199, A038110, A072986, A091440, A256968.

(* For speed and accuracy, the second Mathematica program uses 30-digit real numbers and interval arithmetic. *)
prod=1; k=0; Table[While[prod<=n, k++; prod=prod*Prime[k]/(Prime[k]-1)]; k, {n,0,25}] (* T. D. Noe, May 08 2006 *)
prod=Interval[1]; k=0; Table[While[Max[prod]<=n, k++; p=Prime[k]; prod=N[prod*p/(p-1),30]]; If[Min[prod]>n, k, "too few digits"], {n,0,38}]

a(n)=my(s=1,k); forprime(p=2,, s*=p/(p-1); k++; if(s>n, return(k))) \\ Charles R Greathouse IV, Aug 20 2015

from sympy import nextprime
def a_list(upto: int) -> list[int]:
    L: list[int] = [0]
    count = 1; bn = 1; bd = 1; p = 2
    for k in range(1, upto + 1):
        bn *= p
        bd *= p - 1
        while bn > count * bd:
            L.append(k)
            count += 1
        p = nextprime(p)
    return L
print(a_list(1000))  # Chai Wah Wu, Apr 17 2015, adapted by Peter Luschny, Jan 25 2025

a(n) = smallest k such that A002110(k)/A005867(k) > n. - Artur Jasinski, Nov 06 2008

a(n) = PrimePi(A091440(n)) = A000720(A091440(n)) for n >= 4. - Amiram Eldar, Apr 18 2025

Edited by T. D. Noe, May 08 2006
a(26) added by T. D. Noe, Sep 18 2008
Typo corrected by Vincent E. Yu (yu.vincent.e(AT)gmail.com), Aug 14 2009
a(27)-a(36) from Vincent E. Yu (yu.vincent.e(AT)gmail.com), Aug 14 2009
Comment corrected by T. D. Noe, Apr 04 2010
a(37)-a(39) from T. D. Noe, Nov 16 2010
Edited and terms a(0)-a(1) prepended by Max Alekseyev, Jan 25 2025

A108775 a(n) = floor(sigma(n)/n).

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1

Offset: 1

Franz Vrabec, Jun 27 2005

nonn

The sequence is unbounded. - Vrabec
First occurrence of k: 1,6,120,27720,..., which is A023199. - Robert G. Wilson v, Jun 28 2005
a(n) > 1 if n is perfect or abundant. a(n) = 2 if n is perfect or primitive abundant (see A091191). - Alonso del Arte, Feb 06 2012

			a(6) = 2 because sigma(6)/6 = (1 + 2 + 3 + 6)/6 = 2.

W. Sierpinski, Elementary Theory of Numbers, 1987, p. 174 ff.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A000203, A054024.

Cf. A017665, A017666.

a108775 n = div (a000203 n) n  -- Reinhard Zumkeller, Mar 23 2013

Table[ Floor[ DivisorSigma[1, n]/n], {n, 105}] (* Robert G. Wilson v, Jun 28 2005 *)

a(n) = sigma(n)\n; \\ Michel Marcus, Sep 18 2015

a(n) = floor(A017665(n)/A017666(n)). - Michel Marcus, Sep 18 2015

More terms from Robert G. Wilson v, Jun 28 2005

A215264 Numbers k such that sigma(k) > 5*k.

Original entry on oeis.org

122522400, 147026880, 183783600, 205405200, 220540320, 232792560, 245044800, 273873600, 294053760, 328648320, 367567200, 410810400, 428828400, 441080640, 465585120, 490089600, 492972480, 497296800, 514594080, 537213600, 547747200, 551350800, 563603040

Offset: 1

Donovan Johnson, Aug 07 2012

nonn

The asymptotic density of this sequence is > 1/a(1) ~ 8*10^(-9). Wall et al. (1972) proved that it is < 0.0122. - Amiram Eldar, Feb 13 2021

			sigma(122522400) = 614210688 and 614210688 > 5 * 122522400.

Donovan Johnson, Table of n, a(n) for n = 1..10000
Richard Laatsch, Measuring the Abundancy of Integers, Mathematics Magazine, Vol. 59, No. 2 (1986), pp. 84-92, alternative link.
Gordon L. Miller and Mary T. Whalen, Multiply Abundant Numbers, School Science and Mathematics, Volume 95, Issue 5 (May 1995), pp. 256-259.
Charles R. Wall, Phillip L. Crews and Donald B. Johnson, Density Bounds for the Sum of Divisors Function, Mathematics of Computation, Vol. 26, No. 119 (1972), pp. 773-777; Errata, Vol. 31, No. 138 (1977), p. 616.

Cf. A000203, A001221, A023199, A068403, A068404.

for(n=122522400, 563603040, if(sigma(n)>5*n, print1(n ", ")))

A001221(a(n)) >= 6 (Laatsch, 1986). - Amiram Eldar, Nov 07 2020

A033885 a(n) = 3*n - sum of divisors of n.

Original entry on oeis.org

2, 3, 5, 5, 9, 6, 13, 9, 14, 12, 21, 8, 25, 18, 21, 17, 33, 15, 37, 18, 31, 30, 45, 12, 44, 36, 41, 28, 57, 18, 61, 33, 51, 48, 57, 17, 73, 54, 61, 30, 81, 30, 85, 48, 57, 66, 93, 20, 90, 57, 81, 58, 105, 42, 93, 48, 91, 84, 117, 12, 121, 90, 85, 65, 111, 54, 133, 78, 111, 66

Offset: 1

N. J. A. Sloane

The first zero term occurs at n = 120. The first negative term is a(180) = -6. For any k, k*n - sigma(n) is negative for some n. See A023199. - T. D. Noe, Aug 07 2003

			For n=4, 3n=12, sum of divisors of n is 1+2+4=7, so a(4)=12-7=5.

Ivan Neretin, Table of n, a(n) for n = 1..10000

Cf. A000203, A008585, A013661, A023199.

with(numtheory): for n from 1 to 150 do printf(`%d,`,3*n-sigma(n)) od:

Table[3 n - DivisorSigma[1, n], {n, 70}] (* Ivan Neretin, Sep 30 2017 *)

a(n)=3*n-sigma(n) \\ Charles R Greathouse IV, Mar 16 2016

a(n) = A008585(n) - A000203(n). - Omar E. Pol, Sep 30 2017

Sum_{k=1..n} a(k) ~ c * n^2 / 2, where c = 3 - zeta(2) = 1.355065... . - Amiram Eldar, Mar 25 2024

More terms from James Sellers, Jun 01 2000

A067385 a(n) is smallest x such that sigma(phi(x))/sigma(x) = n.

Original entry on oeis.org

1, 13, 181, 121679, 1033474069

Offset: 1

Dean Hickerson, Jan 20 2002

A023199(6) < a(6) <= 1794819234390989. - Donovan Johnson, Oct 24 2011

Cf. A023199, A033631, A066831, A067382, A067383, A067384, A197952.

a[ n_ ] := For[ x=1, True, x++, If[ DivisorSigma[ 1, EulerPhi[ x ] ]/DivisorSigma[ 1, x ]==n, Return[ x ] ] ]

a(5) from Vim Wenders, Mar 11 2007

A358412 Least number k coprime to 2 and 3 such that sigma(k)/k >= n.

Original entry on oeis.org

1, 5391411025, 5164037398437051798923642083026622326955987448536772329145127064375

Offset: 1

Jianing Song, Nov 14 2022

Data copied from the Hi.gher. Space link where Mercurial, the Spectre calculated the terms. We have a(2) = 5^2*7*...*29 and a(3) = 5^4*7^3*11^2*13^2*17*...*157 ~ 5.16404*10^66. a(4) = 5^5*7^4*11^3*13^3*17^2*19^2*23^2*29^2*31^2*37^2*41*...*853 ~ 1.83947*10^370 is too large to display.

			a(2) = A047802(2) = 5391411025 is the smallest abundant number coprime to 2 and 3.
Even if there is a number k coprime to 2 and 3 with sigma(k)/k = 3, we have that k is a square since sigma(k) is odd. If omega(k) = m, then 3 = sigma(k)/k < Product_{i=3..m+2} (prime(i)/(prime(i)-1)) => m >= 33, and we have k >= prime(3)^2*...*prime(35)^2 ~ 6.18502*10^112 > A358413(2) ~ 5.16403*10^66. So a(3) = A358413(2).
Even if there is a number k coprime to 2 and 3 with sigma(k)/k = 4, there can be at most 2 odd exponents in the prime factorization of k (see Theorem 2.1 of the Broughan and Zhou link). If omega(k) = m, then 4 = sigma(k)/k < Product_{i=3..m+2} (prime(i)/(prime(i)-1)) => m >= 140, and we have k >= prime(3)^2*...*prime(140)^2*prime(141)*prime(142) ~ 2.65585*10^669 > A358414(2) ~ 1.83947*10^370. So a(4) = A358414(2).

Jianing Song, Table of n, a(n) for n = 1..4
Kevin A. Broughan and Qizhi Zhou, Odd multiperfect numbers of abundancy 4, author’s version, Research Commons.
Kevin A. Broughan and Qizhi Zhou, Odd multiperfect numbers of abundancy 4, Journal of Number Theory 128 (2008) 1566-1575.
Mercurial, the Spectre, Abundant numbers coprime to n, Hi.gher. Space.

Smallest k-abundant number which is not divisible by any of the first n primes: A047802 (k=2), A358413 (k=3), A358414 (k=4).

Least p-rough number k such that sigma(k)/k >= n: A023199 (p=2), A119240 (p=3), this sequence (p=5), A358418 (p=7), A358419 (p=11).

cp's OEIS Frontend

A108402 Largest prime factor of A023199(n).

Views

Author

Keywords

Crossrefs

Extensions

A004394 Superabundant [or super-abundant] numbers: n such that sigma(n)/n > sigma(m)/m for all m < n, sigma(n) being A000203(n), the sum of the divisors of n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A119240 Least odd number k such that sigma(k)/k >= n.

Views

Author

Keywords

Comments

Links

Crossrefs

A103288 Numbers k such that sigma(k) >= 2k-1 (union of perfect, abundant and least deficient numbers).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A005579 a(n) = smallest number k such that Product_{i=1..k} prime(i)/(prime(i)-1) > n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

Extensions

A108775 a(n) = floor(sigma(n)/n).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

Extensions

A215264 Numbers k such that sigma(k) > 5*k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A033885 a(n) = 3*n - sum of divisors of n.