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.

A281497 Write n in binary reflected Gray code and sum the positions where there is a '1' followed immediately to the left by a '0', counting the rightmost digit as position 1.

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 2, 2, 1, 0, 0, 1, 2, 2, 0, 0, 1, 0, 3, 4, 3, 3, 2, 2, 1, 0, 0, 1, 2, 2, 3, 3, 4, 3, 0, 1, 0, 0, 2, 2, 1, 0, 4, 5, 6, 6, 4, 4, 5, 4, 3, 4, 3, 3, 2, 2, 1, 0, 0, 1, 2, 2, 3, 3, 4, 3, 4, 5, 4, 4, 6, 6, 5, 4, 0, 1, 2, 2, 0, 0, 1, 0, 3, 4, 3, 3, 2, 2, 1, 0, 5, 6, 7, 7, 8, 8, 9, 8, 5, 6, 5, 5, 7, 7, 6]