A071906 - OEIS

This site is supported by donations to The OEIS Foundation.

A071906

Sum of digits of 2^n (mod 2).

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

	OFFSET	`0,1`
	MATHEMATICA	`f[n_] := Mod[Plus @@ IntegerDigits[2^n], 2]; Table[ f@n, {n, 0, 104}] [From Robert G. Wilson v (rgwv(AT)rgwv.com), May 04 2009]`
	CROSSREFS	`Cf. A001370.` `Sequence in context: A068433 A088592 A029692 * A104107 A120532 A004555` `Adjacent sequences: A071903 A071904 A071905 * A071907 A071908 A071909`
	KEYWORD	`base,nonn`
	AUTHOR	`Santi Spadaro (spados(AT)katamail.com), Jun 13 2002`

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

Last modified February 16 01:56 EST 2012. Contains 205860 sequences.