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.

A089309 Write n in binary; a(n) = length of the rightmost run of 1's.

Table of values

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

List of values

[0, 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 2, 2, 1, 3, 4, 1, 1, 1, 2, 1, 1, 2, 3, 2, 1, 1, 2, 3, 1, 4, 5, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 2, 2, 1, 3, 4, 2, 1, 1, 2, 1, 1, 2, 3, 3, 1, 1, 2, 4, 1, 5, 6, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 2, 2, 1, 3, 4, 1, 1, 1, 2, 1, 1, 2, 3, 2, 1, 1, 2, 3, 1, 4, 5, 2, 1, 1, 2, 1, 1, 2, 3, 1]