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.

A165414 a(n) = number of run-lengths that each occur only once in the binary representation of n.

Table of values

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

List of values

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