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.

A323434 Number of ways to split a strict integer partition of n into consecutive subsequences of equal length.

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 3
5 5
6 7
7 9
8 11
9 15
10 20
11 24
12 31
13 38
14 48
15 59
16 72
17 86
18 106
19 125
20 150
21 180
22 213
23 250
24 296
25 347
26 407
27 477
28 555
29 645
30 751
31 869
32 1003
33 1161
34 1334
35 1534
36 1763
37 2018
38 2306
39 2637
40 3002
41 3418
42 3886
43 4409
44 4994
45 5659
46 6390
47 7214
48 8135
49 9160
50 10300
51 11580
52 12990

List of values

[1, 1, 1, 3, 3, 5, 7, 9, 11, 15, 20, 24, 31, 38, 48, 59, 72, 86, 106, 125, 150, 180, 213, 250, 296, 347, 407, 477, 555, 645, 751, 869, 1003, 1161, 1334, 1534, 1763, 2018, 2306, 2637, 3002, 3418, 3886, 4409, 4994, 5659, 6390, 7214, 8135, 9160, 10300, 11580, 12990]