A053867 - OEIS

This site is supported by donations to The OEIS Foundation.

A053867

Parity of sum of divisors of n less than n.

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

	OFFSET	`1,1`
	FORMULA	`a(n) = A001065(n) mod 2`
	EXAMPLE	`a(9)=0 because sum of divisors of 9 is 1+3=4 which is even`
	CROSSREFS	`Cf. A001065.` `Sequence in context: A131720 A131719 A100656 * A069513 A092248 A106743` `Adjacent sequences: A053864 A053865 A053866 * A053868 A053869 A053870`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 29 2000`
	EXTENSIONS	`More terms from James A. Sellers (sellersj(AT)math.psu.edu), Apr 08 2000`

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

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.