cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A306923 Sum over all partitions of n into distinct parts of the bitwise AND of the parts.

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 5
5 7
6 7
7 7
8 12
9 18
10 18
11 22
12 23
13 25
14 19
15 26
16 37
17 49
18 55
19 64
20 67
21 78
22 80
23 93
24 101
25 110
26 106
27 122
28 114
29 129
30 136
31 158
32 197
33 237
34 256
35 287
36 311
37 337
38 367
39 403
40 424
41 453
42 492
43 525
44 571
45 638
46 684
47 754
48 809
49 853
50 896
51 955
52 995
53 1075
54 1149
55 1226
56 1295
57 1412

List of values

[0, 1, 2, 3, 5, 7, 7, 7, 12, 18, 18, 22, 23, 25, 19, 26, 37, 49, 55, 64, 67, 78, 80, 93, 101, 110, 106, 122, 114, 129, 136, 158, 197, 237, 256, 287, 311, 337, 367, 403, 424, 453, 492, 525, 571, 638, 684, 754, 809, 853, 896, 955, 995, 1075, 1149, 1226, 1295, 1412]