A144789 - cp's OEIS frontend

A144789 Consider the runs of 0's in the binary representation of n, each of these runs being on the edge of the binary representation n and/or being bounded by 1's. a(n) = the length of the shortest such run (with positive length) of 0's in binary n. a(n) = 0 if there are no runs of 0's in binary n.

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

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

cp's OEIS Frontend

A144789 Consider the runs of 0's in the binary representation of n, each of these runs being on the edge of the binary representation n and/or being bounded by 1's. a(n) = the length of the shortest such run (with positive length) of 0's in binary n. a(n) = 0 if there are no runs of 0's in binary n.

Table of values

List of values

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

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

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