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.

A065359 Alternating bit sum for n: replace 2^k with (-1)^k in binary expansion of n.

Table of values

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

List of values

[0, 1, -1, 0, 1, 2, 0, 1, -1, 0, -2, -1, 0, 1, -1, 0, 1, 2, 0, 1, 2, 3, 1, 2, 0, 1, -1, 0, 1, 2, 0, 1, -1, 0, -2, -1, 0, 1, -1, 0, -2, -1, -3, -2, -1, 0, -2, -1, 0, 1, -1, 0, 1, 2, 0, 1, -1, 0, -2, -1, 0, 1, -1, 0, 1, 2, 0, 1, 2, 3, 1, 2, 0, 1, -1, 0, 1, 2, 0, 1, 2, 3, 1, 2, 3, 4, 2, 3, 1, 2, 0, 1, 2, 3, 1, 2, 0, 1, -1, 0, 1, 2, 0, 1, -1, 0, -2]