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.

A384887 Number of integer partitions of n with all equal lengths of maximal gapless runs (decreasing by 0 or 1).

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 5
5 6
6 9
7 10
8 14
9 18
10 21
11 26
12 35
13 39
14 46
15 58
16 68
17 79
18 97
19 111
20 131
21 155
22 177
23 206
24 246
25 278
26 318
27 373
28 423
29 483
30 563
31 632
32 722
33 827
34 931
35 1058
36 1209
37 1354
38 1528
39 1736
40 1951
41 2188
42 2475
43 2762
44 3097
45 3488
46 3886
47 4342
48 4876
49 5414
50 6038
51 6741
52 7482

List of values

[1, 1, 2, 3, 5, 6, 9, 10, 14, 18, 21, 26, 35, 39, 46, 58, 68, 79, 97, 111, 131, 155, 177, 206, 246, 278, 318, 373, 423, 483, 563, 632, 722, 827, 931, 1058, 1209, 1354, 1528, 1736, 1951, 2188, 2475, 2762, 3097, 3488, 3886, 4342, 4876, 5414, 6038, 6741, 7482]