A294991 - cp's OEIS frontend

A294991 Let S be the sequence of integer sets defined by the following rules: S(0) = {0}, S(1) = {1} and for any k > 0, S(2k) = {2k} U S(k) and S(2k+1) = {2k+1} U S(k) U S(k+1) (where X U Y denotes the union of the sets X and Y); a(n) = the number of elements of S(n).

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

[1, 1, 2, 3, 3, 4, 4, 5, 4, 6, 5, 6, 5, 7, 6, 7, 5, 8, 7, 8, 6, 8, 7, 8, 6, 9, 8, 9, 7, 9, 8, 9, 6, 10, 9, 10, 8, 10, 9, 10, 7, 10, 9, 10, 8, 10, 9, 10, 7, 11, 10, 11, 9, 11, 10, 11, 8, 11, 10, 11, 9, 11, 10, 11, 7, 12, 11, 12, 10, 12, 11, 12, 9, 12, 11, 12, 10]

cp's OEIS Frontend

A294991 Let S be the sequence of integer sets defined by the following rules: S(0) = {0}, S(1) = {1} and for any k > 0, S(2k) = {2k} U S(k) and S(2k+1) = {2k+1} U S(k) U S(k+1) (where X U Y denotes the union of the sets X and Y); a(n) = the number of elements of S(n).

Table of values

List of values

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

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

cp's OEIS Frontend

A294991 Let S be the sequence of integer sets defined by the following rules: S(0) = {0}, S(1) = {1} and for any k > 0, S(2*k) = {2*k} U S(k) and S(2*k+1) = {2*k+1} U S(k) U S(k+1) (where X U Y denotes the union of the sets X and Y); a(n) = the number of elements of S(n).

Table of values

List of values

A294991 Let S be the sequence of integer sets defined by the following rules: S(0) = {0}, S(1) = {1} and for any k > 0, S(2k) = {2k} U S(k) and S(2k+1) = {2k+1} U S(k) U S(k+1) (where X U Y denotes the union of the sets X and Y); a(n) = the number of elements of S(n).

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