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.

A316996 Consider a partition of n into distinct parts with the summands written in binary notation. a(n) is the number of such partitions whose binary representation has an odd number of binary ones.

Table of values

n a(n)
0 0
1 1
2 1
3 0
4 2
5 1
6 1
7 5
8 2
9 2
10 7
11 6
12 6
13 12
14 10
15 8
16 23
17 19
18 15
19 37
20 27
21 32
22 60
23 42
24 54
25 87
26 74
27 88
28 130
29 116
30 134
31 206
32 173
33 203
34 305
35 256
36 325
37 437
38 375
39 485
40 624
41 574
42 700
43 879
44 836
45 1008
46 1268
47 1190
48 1433
49 1773
50 1688
51 2059
52 2443
53 2376
54 2883
55 3362
56 3356
57 3978

List of values

[0, 1, 1, 0, 2, 1, 1, 5, 2, 2, 7, 6, 6, 12, 10, 8, 23, 19, 15, 37, 27, 32, 60, 42, 54, 87, 74, 88, 130, 116, 134, 206, 173, 203, 305, 256, 325, 437, 375, 485, 624, 574, 700, 879, 836, 1008, 1268, 1190, 1433, 1773, 1688, 2059, 2443, 2376, 2883, 3362, 3356, 3978]