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.

A102437 Let pi be an unrestricted partition of n 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 1
4 3
5 3
6 5
7 9
8 10
9 14
10 22
11 28
12 37
13 53
14 66
15 85
16 120
17 147
18 188
19 252
20 308
21 394
22 509
23 621
24 783
25 990
26 1210
27 1500
28 1872
29 2272
30 2793
31 3447
32 4152
33 5064
34 6184
35 7414
36 8984
37 10856
38 12964
39 15592
40 18711
41 22250
42 26576
43 31690
44 37520
45 44565
46 52856
47 62292

List of values

[0, 1, 1, 1, 3, 3, 5, 9, 10, 14, 22, 28, 37, 53, 66, 85, 120, 147, 188, 252, 308, 394, 509, 621, 783, 990, 1210, 1500, 1872, 2272, 2793, 3447, 4152, 5064, 6184, 7414, 8984, 10856, 12964, 15592, 18711, 22250, 26576, 31690, 37520, 44565, 52856, 62292]