A091194 - OEIS

This site is supported by donations to The OEIS Foundation.

A091194

Number of abundant numbers <= n.

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; internal format)

	OFFSET	`1,18`
	LINKS	`Eric Weisstein's World of Mathematics, Abundant Number`
	MATHEMATICA	`Contribution from Enrique Perez Herrero (psychgeometry(AT)gmail.com), Aug 14 2010: (Start)` `(Recursive expression with data kept in memory)` `A091194[1]=0;` `A091194[n_]:=A091194[n]=A091194[n-1]+Boole[DivisorSigma[1, n]>2n]; (End)`
	CROSSREFS	`Cf. A005101, A091195.` `Sequence in context: A196050 A122027 A112751 * A156079 A061555 A146323` `Adjacent sequences: A091191 A091192 A091193 * A091195 A091196 A091197`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 27 2003`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 20:03 EST 2012. Contains 205852 sequences.