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.

A336134 Number of ways to split an integer partition of n into contiguous subsequences with strictly increasing sums.

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 6
5 11
6 17
7 27
8 37
9 62
10 82
11 125
12 168
13 246
14 320
15 462
16 585
17 839
18 1078
19 1466
20 1830
21 2528
22 3136
23 4188
24 5210
25 6907
26 8498
27 11177
28 13570
29 17668
30 21614
31 27580
32 33339
33 42817
34 51469
35 65083
36 78457
37 98409
38 117602
39 147106
40 174663
41 217400
42 259318
43 319076
44 377707

List of values

[1, 1, 2, 4, 6, 11, 17, 27, 37, 62, 82, 125, 168, 246, 320, 462, 585, 839, 1078, 1466, 1830, 2528, 3136, 4188, 5210, 6907, 8498, 11177, 13570, 17668, 21614, 27580, 33339, 42817, 51469, 65083, 78457, 98409, 117602, 147106, 174663, 217400, 259318, 319076, 377707]