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.

A091889 Number of partitions of n into sums of exactly two distinct powers of 2.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 1
6 2
7 0
8 1
9 3
10 2
11 2
12 5
13 2
14 3
15 8
16 4
17 6
18 12
19 6
20 11
21 16
22 11
23 16
24 24
25 17
26 23
27 34
28 26
29 35
30 50
31 35
32 50
33 67
34 55
35 72
36 93
37 76
38 99
39 126
40 112
41 135
42 171
43 150
44 186
45 229
46 210
47 249
48 304
49 280
50 336
51 398
52 380
53 443
54 526
55 499
56 584
57 680
58 665
59 759
60 886
61 858
62 985
63 1136
64 1123

List of values

[0, 0, 1, 0, 1, 2, 0, 1, 3, 2, 2, 5, 2, 3, 8, 4, 6, 12, 6, 11, 16, 11, 16, 24, 17, 23, 34, 26, 35, 50, 35, 50, 67, 55, 72, 93, 76, 99, 126, 112, 135, 171, 150, 186, 229, 210, 249, 304, 280, 336, 398, 380, 443, 526, 499, 584, 680, 665, 759, 886, 858, 985, 1136, 1123]