A336133 - cp's OEIS frontend

A336133 Number of ways to split a strict integer partition of n into contiguous subsequences with strictly increasing sums.

n	a(n)
0	1
1	1
2	1
3	2
4	2
5	3
6	4
7	5
8	6
9	9
10	11
11	14
12	17
13	22
14	26
15	35
16	40
17	51
18	60
19	75
20	86
21	109
22	124
23	153
24	175
25	214
26	243
27	297
28	336
29	403
30	456
31	546
32	614
33	731
34	821
35	975
36	1095
37	1283
38	1437
39	1689
40	1887
41	2195
42	2448
43	2851
44	3172
45	3676
46	4083
47	4724
48	5245
49	6022
50	6677
51	7695
52	8504
53	9720

[1, 1, 1, 2, 2, 3, 4, 5, 6, 9, 11, 14, 17, 22, 26, 35, 40, 51, 60, 75, 86, 109, 124, 153, 175, 214, 243, 297, 336, 403, 456, 546, 614, 731, 821, 975, 1095, 1283, 1437, 1689, 1887, 2195, 2448, 2851, 3172, 3676, 4083, 4724, 5245, 6022, 6677, 7695, 8504, 9720]

cp's OEIS Frontend

A336133 Number of ways to split a strict integer partition of n into contiguous subsequences with strictly increasing sums.

Table of values

List of values