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.

A384884 Number of integer partitions of n with all distinct 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 4
5 6
6 9
7 13
8 18
9 25
10 35
11 46
12 60
13 79
14 104
15 131
16 170
17 215
18 271
19 342
20 431
21 535
22 670
23 830
24 1019
25 1258
26 1547
27 1881
28 2298
29 2787
30 3359
31 4061
32 4890
33 5849
34 7010
35 8361
36 9942
37 11825
38 14021
39 16558
40 19561
41 23057
42 27084
43 31821
44 37312
45 43627
46 50999
47 59500
48 69267

List of values

[1, 1, 2, 3, 4, 6, 9, 13, 18, 25, 35, 46, 60, 79, 104, 131, 170, 215, 271, 342, 431, 535, 670, 830, 1019, 1258, 1547, 1881, 2298, 2787, 3359, 4061, 4890, 5849, 7010, 8361, 9942, 11825, 14021, 16558, 19561, 23057, 27084, 31821, 37312, 43627, 50999, 59500, 69267]