A323665 - cp's OEIS frontend

A323665 a(n) is the number of vertices in the binary tree the root of which is assigned the value n and built recursively by the rule: write node's value as (2^c)*(2k+1); if c>0, create a left child with value c; if k>0, create a right child with value k.

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

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

cp's OEIS Frontend

A323665 a(n) is the number of vertices in the binary tree the root of which is assigned the value n and built recursively by the rule: write node's value as (2^c)*(2k+1); if c>0, create a left child with value c; if k>0, create a right child with value k.

Table of values

List of values

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

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

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