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.

A294199 Number of partitions of n into powers of 2 such that 1 and 2 cannot both be parts of a particular partition, and 4 and 8 cannot both be parts of a particular partition, and 16 and 32, and so on.

Table of values

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

List of values

[1, 1, 2, 1, 3, 2, 4, 2, 6, 4, 8, 4, 9, 5, 10, 5, 13, 8, 16, 8, 18, 10, 20, 10, 24, 14, 28, 14, 30, 16, 32, 16, 38, 22, 44, 22, 48, 26, 52, 26, 60, 34, 68, 34, 72, 38, 76, 38, 85, 47, 94, 47, 99, 52, 104, 52, 114, 62, 124, 62, 129, 67, 134, 67, 147, 80, 160]