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.

A117930 Number of partitions of 2n into factorial parts (0! not allowed, i.e., only one kind of 1 can be a part). Also number of partitions of 2n+1 into factorial parts.

Table of values

n a(n)
0 1
1 2
2 3
3 5
4 7
5 9
6 12
7 15
8 18
9 22
10 26
11 30
12 36
13 42
14 48
15 56
16 64
17 72
18 82
19 92
20 102
21 114
22 126
23 138
24 153
25 168
26 183
27 201
28 219
29 237
30 258
31 279
32 300
33 324
34 348
35 372
36 400
37 428
38 456
39 488
40 520
41 552
42 588
43 624
44 660
45 700
46 740
47 780
48 825
49 870
50 915
51 965
52 1015
53 1065
54 1120
55 1175
56 1230

List of values

[1, 2, 3, 5, 7, 9, 12, 15, 18, 22, 26, 30, 36, 42, 48, 56, 64, 72, 82, 92, 102, 114, 126, 138, 153, 168, 183, 201, 219, 237, 258, 279, 300, 324, 348, 372, 400, 428, 456, 488, 520, 552, 588, 624, 660, 700, 740, 780, 825, 870, 915, 965, 1015, 1065, 1120, 1175, 1230]