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.

A317715 Number of ways to split an integer partition of n into consecutive subsequences with equal sums.

Table of values

n a(n)
0 1
1 1
2 3
3 4
4 9
5 8
6 21
7 16
8 39
9 38
10 64
11 57
12 146
13 102
14 186
15 211
16 352
17 298
18 593
19 491
20 906
21 880
22 1273
23 1256
24 2444
25 1998
26 3038
27 3277
28 4861
29 4566
30 7710
31 6843
32 10841
33 10742
34 14966
35 15071
36 24499
37 21638
38 31334
39 32706
40 47157
41 44584
42 67464
43 63262
44 91351
45 94247
46 125248

List of values

[1, 1, 3, 4, 9, 8, 21, 16, 39, 38, 64, 57, 146, 102, 186, 211, 352, 298, 593, 491, 906, 880, 1273, 1256, 2444, 1998, 3038, 3277, 4861, 4566, 7710, 6843, 10841, 10742, 14966, 15071, 24499, 21638, 31334, 32706, 47157, 44584, 67464, 63262, 91351, 94247, 125248]