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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091194 Number of abundant numbers <= n. 4
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 17, 17, 17, 17, 18, 18, 18 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,18 LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 Marc Deléglise, Bounds for the density of abundant integers, Experiment. Math. Volume 7, Issue 2 (1998), 137-143. Charles R. Wall, Phillip L. Crews and Donald B. Johnson, Density bounds for the sum of divisors function, Math. Comp. 26 (1972), 773-777. Eric Weisstein's World of Mathematics, Abundant Number FORMULA a(n) ~ c*n, where c = 0.247619... is the asymptotic density of the abundant numbers (A302991). - Amiram Eldar, Mar 21 2021 MATHEMATICA A091194[1]=0; A091194[n_]:=A091194[n]=A091194[n-1]+Boole[DivisorSigma[1, n]>2n]; (* Recursive expression with data kept in memory; Enrique Pérez Herrero, Aug 14 2010 *) PROG (PARI) a(n) = sum(k=1, n, sigma(k)/k > 2); \\ Michel Marcus, Apr 02 2015 (Magma) [#[k:k in [1..n]| DivisorSigma(1, k) gt 2*k]:n in [1..90]]; // Marius A. Burtea, Nov 06 2019 CROSSREFS Partial sums of A294937. Cf. A005101, A091195, A256562, A302991. Sequence in context: A331246 A331256 A283297 * A156079 A268708 A061555 Adjacent sequences: A091191 A091192 A091193 * A091195 A091196 A091197 KEYWORD nonn AUTHOR Reinhard Zumkeller, Dec 27 2003 STATUS approved

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.

Last modified June 1 17:30 EDT 2023. Contains 363076 sequences. (Running on oeis4.)