A091195 - OEIS

This site is supported by donations to The OEIS Foundation.

A091195

Number of numbers <= n having only one abundant divisor.

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,18`
	LINKS	`Eric Weisstein's World of Mathematics, Abundant Number`
	CROSSREFS	`Cf. A091191, A091194, A005101.` `Sequence in context: A063510 A156878 A140474 * A072375 A131981 A130147` `Adjacent sequences: A091192 A091193 A091194 * A091196 A091197 A091198`
	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 04:59 EST 2012. Contains 205694 sequences.