A114567 - cp's OEIS frontend

A114567 a(n) is the number k such that the binary expansion of n mod 2^k is the postorder traversal of a binary tree, where 1 indicates a node and 0 indicates there are no children on that side.

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

[1, 3, 1, 5, 1, 5, 1, 7, 1, 3, 1, 7, 1, 7, 1, 9, 1, 3, 1, 7, 1, 7, 1, 9, 1, 3, 1, 9, 1, 9, 1, 11, 1, 3, 1, 5, 1, 5, 1, 9, 1, 3, 1, 9, 1, 9, 1, 11, 1, 3, 1, 9, 1, 9, 1, 11, 1, 3, 1, 11, 1, 11, 1, 13, 1, 3, 1, 5, 1, 5, 1, 9, 1, 3, 1, 9, 1, 9, 1, 11, 1, 3, 1, 9, 1, 9, 1, 11, 1, 3, 1, 11, 1, 11, 1, 13, 1, 3, 1, 5, 1]

cp's OEIS Frontend

A114567 a(n) is the number k such that the binary expansion of n mod 2^k is the postorder traversal of a binary tree, where 1 indicates a node and 0 indicates there are no children on that side.

Table of values

List of values

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

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

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