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.

A384904 Number of integer partitions of n with all equal 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 2
3 3
4 4
5 5
6 9
7 9
8 14
9 17
10 23
11 25
12 40
13 41
14 59
15 68
16 92
17 99
18 140
19 151
20 204
21 229
22 296
23 328
24 433
25 476
26 606
27 685
28 858
29 955
30 1203
31 1336
32 1654
33 1858
34 2266
35 2537
36 3102
37 3453
38 4169
39 4680
40 5611
41 6262
42 7495
43 8358
44 9927
45 11105
46 13096
47 14613
48 17227
49 19179
50 22459

List of values

[1, 1, 2, 3, 4, 5, 9, 9, 14, 17, 23, 25, 40, 41, 59, 68, 92, 99, 140, 151, 204, 229, 296, 328, 433, 476, 606, 685, 858, 955, 1203, 1336, 1654, 1858, 2266, 2537, 3102, 3453, 4169, 4680, 5611, 6262, 7495, 8358, 9927, 11105, 13096, 14613, 17227, 19179, 22459]