login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071906 Sum of digits of 2^n (mod 2). 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; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
MATHEMATICA
f[n_] := Mod[Plus @@ IntegerDigits[2^n], 2]; Table[ f@n, {n, 0, 104}] (* Robert G. Wilson v, May 04 2009 *)
PROG
(PARI) a(n) = sumdigits(2^n) % 2; \\ Michel Marcus, Apr 20 2017
CROSSREFS
Cf. A001370.
Sequence in context: A188189 A029692 A309849 * A104107 A120532 A320106
KEYWORD
base,nonn
AUTHOR
Santi Spadaro, Jun 13 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 07:30 EDT 2024. Contains 371235 sequences. (Running on oeis4.)