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.

A384882 Number of integer partitions of n with all distinct lengths of maximal runs of consecutive parts decreasing by 1 but not by 0.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 3
6 2
7 5
8 4
9 5
10 6
11 9
12 7
13 12
14 12
15 11
16 16
17 18
18 17
19 25
20 25
21 23
22 33
23 35
24 36
25 42
26 52
27 45
28 58
29 64
30 60
31 77
32 91
33 79
34 109
35 108
36 105
37 129
38 149
39 134
40 170
41 179
42 177
43 213
44 236
45 208
46 275
47 281
48 282
49 323
50 359
51 330
52 410
53 433
54 440
55 474
56 541
57 508
58 614
59 631
60 635

List of values

[1, 1, 1, 2, 2, 3, 2, 5, 4, 5, 6, 9, 7, 12, 12, 11, 16, 18, 17, 25, 25, 23, 33, 35, 36, 42, 52, 45, 58, 64, 60, 77, 91, 79, 109, 108, 105, 129, 149, 134, 170, 179, 177, 213, 236, 208, 275, 281, 282, 323, 359, 330, 410, 433, 440, 474, 541, 508, 614, 631, 635]