A072219 - cp's OEIS frontend

A072219 Any number n can be written uniquely in the form n = 2^k_1 - 2^k_2 + 2^k_3 - ... + 2^k_{2r+1} where the signs alternate, there are an odd number of terms, and k_1 > k_2 > k_3 > ... > k_{2r+1} >= 0; sequence gives number of terms 2r+1.

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

[1, 1, 3, 1, 3, 3, 3, 1, 3, 3, 5, 3, 3, 3, 3, 1, 3, 3, 5, 3, 5, 5, 5, 3, 3, 3, 5, 3, 3, 3, 3, 1, 3, 3, 5, 3, 5, 5, 5, 3, 5, 5, 7, 5, 5, 5, 5, 3, 3, 3, 5, 3, 5, 5, 5, 3, 3, 3, 5, 3, 3, 3, 3, 1, 3, 3, 5, 3, 5, 5, 5, 3, 5, 5, 7, 5, 5, 5, 5, 3, 5, 5, 7, 5, 7, 7, 7, 5, 5, 5, 7, 5, 5, 5, 5, 3, 3, 3, 5, 3, 5, 5, 5, 3, 5]

cp's OEIS Frontend

A072219 Any number n can be written uniquely in the form n = 2^k_1 - 2^k_2 + 2^k_3 - ... + 2^k_{2r+1} where the signs alternate, there are an odd number of terms, and k_1 > k_2 > k_3 > ... > k_{2r+1} >= 0; sequence gives number of terms 2r+1.

Table of values

List of values

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

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

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