id:A053867 - OEIS Search Results

Search: id:A053867

Displaying 1-1 of 1 results found.

page 1

Parity of sum of divisors of n less than n.

+0
1

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; listen)

	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 this_sequence A069513 A092248 A106743` `Adjacent sequences: A053864 A053865 A053866 this_sequence 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`

page 1

Search completed in 0.002 seconds

Last modified November 22 20:51 EST 2009. Contains 167312 sequences.

AT&T Labs Research