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.

A339277 Number of partitions of 2*n into powers of 2 where every part appears at least 2 times.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 5
5 6
6 9
7 11
8 16
9 19
10 25
11 30
12 39
13 45
14 56
15 65
16 81
17 92
18 111
19 127
20 152
21 171
22 201
23 226
24 265
25 295
26 340
27 379
28 435
29 480
30 545
31 601
32 682
33 747
34 839
35 920
36 1031
37 1123
38 1250
39 1361
40 1513
41 1640
42 1811
43 1963
44 2164
45 2335
46 2561
47 2762
48 3027
49 3253
50 3548
51 3813
52 4153
53 4448
54 4827
55 5167

List of values

[1, 1, 2, 3, 5, 6, 9, 11, 16, 19, 25, 30, 39, 45, 56, 65, 81, 92, 111, 127, 152, 171, 201, 226, 265, 295, 340, 379, 435, 480, 545, 601, 682, 747, 839, 920, 1031, 1123, 1250, 1361, 1513, 1640, 1811, 1963, 2164, 2335, 2561, 2762, 3027, 3253, 3548, 3813, 4153, 4448, 4827, 5167]