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.

A323433 Number of ways to split an integer partition of n into consecutive subsequences of equal length.

Table of values

n a(n)
0 1
1 1
2 3
3 5
4 10
5 14
6 25
7 34
8 54
9 74
10 109
11 146
12 211
13 276
14 381
15 501
16 675
17 871
18 1156
19 1477
20 1926
21 2447
22 3142
23 3957
24 5038
25 6291
26 7918
27 9839
28 12277
29 15148
30 18773
31 23027
32 28333
33 34587
34 42284
35 51357
36 62466
37 75503
38 91344
39 109971
40 132421
41 158755
42 190365
43 227354
44 271511

List of values

[1, 1, 3, 5, 10, 14, 25, 34, 54, 74, 109, 146, 211, 276, 381, 501, 675, 871, 1156, 1477, 1926, 2447, 3142, 3957, 5038, 6291, 7918, 9839, 12277, 15148, 18773, 23027, 28333, 34587, 42284, 51357, 62466, 75503, 91344, 109971, 132421, 158755, 190365, 227354, 271511]