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.

A139352 Let the binary expansion of n be n = Sum_{k} 2^{r_k}, let e(n) be the number of r_k's that are even, o(n) the number that are odd; sequence gives o(n).

Table of values

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

List of values

[0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 3, 3, 2, 2, 3, 3, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 3, 3, 2, 2, 3, 3, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2]