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.

A091892 Numbers k having only one partition into parts which are a sum of exactly as many distinct powers of 2 as there are 1's in the binary representation of k.

Table of values

n a(n)
1 0
2 1
3 3
4 5
5 7
6 11
7 13
8 15
9 19
10 23
11 27
12 29
13 31
14 39
15 43
16 47
17 51
18 55
19 59
20 61
21 63
22 79
23 87
24 91
25 95
26 103
27 107
28 111
29 115
30 119
31 123
32 125
33 127
34 143
35 159
36 175
37 183
38 187
39 191
40 207
41 215
42 219
43 223
44 231
45 235
46 239
47 243
48 247
49 251
50 253
51 255
52 287
53 303
54 319
55 335
56 351
57 367
58 375
59 379
60 383
61 399

List of values

[0, 1, 3, 5, 7, 11, 13, 15, 19, 23, 27, 29, 31, 39, 43, 47, 51, 55, 59, 61, 63, 79, 87, 91, 95, 103, 107, 111, 115, 119, 123, 125, 127, 143, 159, 175, 183, 187, 191, 207, 215, 219, 223, 231, 235, 239, 243, 247, 251, 253, 255, 287, 303, 319, 335, 351, 367, 375, 379, 383, 399]