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.

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

Table of values

n a(n)
0 1
1 1
2 3
3 5
4 11
5 15
6 31
7 40
8 73
9 98
10 158
11 204
12 340
13 420
14 629
15 819
16 1202
17 1494
18 2174
19 2665
20 3759
21 4688
22 6349
23 7806
24 10788
25 13035
26 17244
27 21128
28 27750
29 33499
30 43941
31 52627
32 67957
33 81773
34 103658
35 124047
36 158628
37 187788
38 235162
39 280188
40 349612
41 413120
42 513952
43 604568

List of values

[1, 1, 3, 5, 11, 15, 31, 40, 73, 98, 158, 204, 340, 420, 629, 819, 1202, 1494, 2174, 2665, 3759, 4688, 6349, 7806, 10788, 13035, 17244, 21128, 27750, 33499, 43941, 52627, 67957, 81773, 103658, 124047, 158628, 187788, 235162, 280188, 349612, 413120, 513952, 604568]