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.

A257265 Distance to n from a leaf nearest to n in the binary beanstalk.

Table of values

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

List of values

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