A006046 - cp's OEIS frontend

A006046 Total number of odd entries in first n rows of Pascal's triangle: a(0) = 0, a(1) = 1, a(2k) = 3a(k), a(2k+1) = 2a(k) + a(k+1). a(n) = Sum_{i=0..n-1} 2^wt(i).

n	a(n)
0	0
1	1
2	3
3	5
4	9
5	11
6	15
7	19
8	27
9	29
10	33
11	37
12	45
13	49
14	57
15	65
16	81
17	83
18	87
19	91
20	99
21	103
22	111
23	119
24	135
25	139
26	147
27	155
28	171
29	179
30	195
31	211
32	243
33	245
34	249
35	253
36	261
37	265
38	273
39	281
40	297
41	301
42	309
43	317
44	333
45	341
46	357
47	373
48	405
49	409
50	417
51	425
52	441
53	449
54	465
55	481
56	513
57	521

[0, 1, 3, 5, 9, 11, 15, 19, 27, 29, 33, 37, 45, 49, 57, 65, 81, 83, 87, 91, 99, 103, 111, 119, 135, 139, 147, 155, 171, 179, 195, 211, 243, 245, 249, 253, 261, 265, 273, 281, 297, 301, 309, 317, 333, 341, 357, 373, 405, 409, 417, 425, 441, 449, 465, 481, 513, 521]

cp's OEIS Frontend

A006046 Total number of odd entries in first n rows of Pascal's triangle: a(0) = 0, a(1) = 1, a(2k) = 3a(k), a(2k+1) = 2a(k) + a(k+1). a(n) = Sum_{i=0..n-1} 2^wt(i).

Table of values

List of values

n	a(n)
0	0
1	1
2	3
3	5
4	9
5	11
6	15
7	19
8	27
9	29
10	33
11	37
12	45
13	49
14	57
15	65
16	81
17	83
18	87
19	91
20	99
21	103
22	111
23	119
24	135
25	139
26	147
27	155
28	171
29	179
30	195
31	211
32	243
33	245
34	249
35	253
36	261
37	265
38	273
39	281
40	297
41	301
42	309
43	317
44	333
45	341
46	357
47	373
48	405
49	409
50	417
51	425
52	441
53	449
54	465
55	481
56	513
57	521

n	a(n)
0	0
1	1
2	3
3	5
4	9
5	11
6	15
7	19
8	27
9	29
10	33
11	37
12	45
13	49
14	57
15	65
16	81
17	83
18	87
19	91
20	99
21	103
22	111
23	119
24	135
25	139
26	147
27	155
28	171
29	179
30	195
31	211
32	243
33	245
34	249
35	253
36	261
37	265
38	273
39	281
40	297
41	301
42	309
43	317
44	333
45	341
46	357
47	373
48	405
49	409
50	417
51	425
52	441
53	449
54	465
55	481
56	513
57	521

cp's OEIS Frontend

A006046 Total number of odd entries in first n rows of Pascal's triangle: a(0) = 0, a(1) = 1, a(2k) = 3*a(k), a(2k+1) = 2*a(k) + a(k+1). a(n) = Sum_{i=0..n-1} 2^wt(i).

Table of values

List of values

A006046 Total number of odd entries in first n rows of Pascal's triangle: a(0) = 0, a(1) = 1, a(2k) = 3a(k), a(2k+1) = 2a(k) + a(k+1). a(n) = Sum_{i=0..n-1} 2^wt(i).

n	a(n)
0	0
1	1
2	3
3	5
4	9
5	11
6	15
7	19
8	27
9	29
10	33
11	37
12	45
13	49
14	57
15	65
16	81
17	83
18	87
19	91
20	99
21	103
22	111
23	119
24	135
25	139
26	147
27	155
28	171
29	179
30	195
31	211
32	243
33	245
34	249
35	253
36	261
37	265
38	273
39	281
40	297
41	301
42	309
43	317
44	333
45	341
46	357
47	373
48	405
49	409
50	417
51	425
52	441
53	449
54	465
55	481
56	513
57	521