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.

A343944 Total number of parts in all partitions of n 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 0
1 1
2 2
3 5
4 7
5 12
6 15
7 29
8 35
9 50
10 58
11 86
12 98
13 128
14 143
15 225
16 251
17 318
18 350
19 453
20 495
21 603
22 653
23 846
24 914
25 1092
26 1172
27 1419
28 1517
29 1773
30 1886
31 2521
32 2687
33 3130
34 3322
35 3917
36 4147
37 4759
38 5021
39 5909
40 6227
41 7082
42 7442
43 8537
44 8955
45 10076
46 10544
47 12326
48 12898
49 14452

List of values

[0, 1, 2, 5, 7, 12, 15, 29, 35, 50, 58, 86, 98, 128, 143, 225, 251, 318, 350, 453, 495, 603, 653, 846, 914, 1092, 1172, 1419, 1517, 1773, 1886, 2521, 2687, 3130, 3322, 3917, 4147, 4759, 5021, 5909, 6227, 7082, 7442, 8537, 8955, 10076, 10544, 12326, 12898, 14452]