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.

A117146 Number of parts in all s-partitions of n. An s-partition of n is a partition of n into parts of the form 2^j-1 (j=1,2,...).

Table of values

n a(n)
0 1
1 2
2 4
3 6
4 8
5 12
6 16
7 20
8 27
9 34
10 40
11 50
12 60
13 70
14 85
15 100
16 115
17 136
18 156
19 176
20 206
21 234
22 261
23 300
24 336
25 370
26 418
27 466
28 511
29 572
30 633
31 690
32 765
33 840
34 914
35 1008
36 1102
37 1194
38 1307
39 1420
40 1530
41 1668
42 1806
43 1940
44 2107
45 2272
46 2431
47 2626
48 2825
49 3016
50 3246
51 3484

List of values

[1, 2, 4, 6, 8, 12, 16, 20, 27, 34, 40, 50, 60, 70, 85, 100, 115, 136, 156, 176, 206, 234, 261, 300, 336, 370, 418, 466, 511, 572, 633, 690, 765, 840, 914, 1008, 1102, 1194, 1307, 1420, 1530, 1668, 1806, 1940, 2107, 2272, 2431, 2626, 2825, 3016, 3246, 3484]