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.

A285097 a(n) = difference between the positions of two least significant 1-bits in base-2 representation of n, or 0 if there are less than two 1-bits in n (when n is either zero or a power of 2).

Table of values

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

List of values

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