cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 1
5 1
6 0
7 1
8 1
9 0
10 1
11 0
12 1
13 0
14 0
15 0
16 1
17 0
18 1
19 1
20 1
21 0
22 1
23 1
24 1
25 1
26 0
27 1
28 1
29 1
30 1
31 1
32 0
33 0
34 1
35 1
36 0
37 0
38 1
39 1
40 1
41 0
42 0
43 0
44 0
45 0
46 0
47 0
48 1
49 1
50 0
51 0
52 1
53 1
54 0
55 0
56 1
57 0
58 0
59 1
60 0
61 0
62 1
63 1
64 0
65 0
66 1
67 0
68 1
69 1
70 0
71 0
72 1
73 0
74 0
75 1
76 0
77 0
78 0
79 0
80 0
81 1
82 0
83 0
84 0
85 0
86 0
87 1
88 1
89 1
90 0
91 0
92 1
93 1
94 1
95 0
96 1
97 1
98 0
99 1
100 1
101 1
102 0
103 0
104 1

List of values

[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]