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.

A343820 Number of partitions of 2n into powers of 2: p1 <= p2 <= ... <= p_k such that p_i <= 1 + Sum_{j=1..i-1} p_j.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 6
5 8
6 12
7 15
8 26
9 32
10 42
11 50
12 68
13 80
14 98
15 113
16 166
17 192
18 230
19 262
20 318
21 360
22 418
23 468
24 572
25 640
26 732
27 812
28 934
29 1032
30 1160
31 1273
32 1626
33 1792
34 2010
35 2202
36 2482
37 2712
38 3006
39 3268
40 3682
41 4000
42 4402
43 4762
44 5254
45 5672
46 6190
47 6658
48 7492
49 8064
50 8772
51 9412

List of values

[1, 1, 2, 3, 6, 8, 12, 15, 26, 32, 42, 50, 68, 80, 98, 113, 166, 192, 230, 262, 318, 360, 418, 468, 572, 640, 732, 812, 934, 1032, 1160, 1273, 1626, 1792, 2010, 2202, 2482, 2712, 3006, 3268, 3682, 4000, 4402, 4762, 5254, 5672, 6190, 6658, 7492, 8064, 8772, 9412]