A060862 - OEIS

This site is supported by donations to The OEIS Foundation.

A060862

a(n) = 0 if n is deficient, 1 if n is abundant, 2 if n is perfect.

0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,6`
	EXAMPLE	`a(6)=2 because 6=1+2+3 and is perfect. a(10)=0 because 10>1+2+5 and is deficient. a(12)=1 because 12<1+2+3+4+6 and is abundant.`
	CROSSREFS	`Cf. A005101 A000396 A005100.` `Sequence in context: A138363 A080225 A122841 * A066087 A080224 A010105` `Adjacent sequences: A060859 A060860 A060861 * A060863 A060864 A060865`
	KEYWORD	`easy,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), May 04 2001`
	EXTENSIONS	`More terms from Erich Friedman (efriedma(AT)stetson.edu), Jun 01 2001`

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

Last modified February 15 07:16 EST 2012. Contains 205700 sequences.