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.

A139354 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 min{e(n), o(n)}.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 0
5 0
6 1
7 1
8 0
9 1
10 0
11 1
12 1
13 1
14 1
15 2
16 0
17 0
18 1
19 1
20 0
21 0
22 1
23 1
24 1
25 1
26 1
27 2
28 1
29 1
30 2
31 2
32 0
33 1
34 0
35 1
36 1
37 1
38 1
39 2
40 0
41 1
42 0
43 1
44 1
45 2
46 1
47 2
48 1
49 1
50 1
51 2
52 1
53 1
54 2
55 2
56 1
57 2
58 1
59 2
60 2
61 2
62 2
63 3
64 0
65 0
66 1
67 1
68 0
69 0
70 1
71 1
72 1
73 1
74 1
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 1

List of values

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