id:A071906 - OEIS Search Results

Search: id:A071906

Displaying 1-1 of 1 results found.

page 1

A071906

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

+0
1

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

	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 this_sequence A104107 A120532 A004555` `Adjacent sequences: A071903 A071904 A071905 this_sequence A071907 A071908 A071909`
	KEYWORD	`base,nonn`
	AUTHOR	`Santi Spadaro (spados(AT)katamail.com), Jun 13 2002`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research