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.

A316245 Number of ways to split an integer partition of n into consecutive subsequences with weakly decreasing sums.

Table of values

n a(n)
0 1
1 1
2 3
3 6
4 14
5 25
6 52
7 89
8 167
9 279
10 486
11 786
12 1322
13 2069
14 3326
15 5128
16 8004
17 12055
18 18384
19 27203
20 40588
21 59186
22 86645
23 124583
24 179784
25 255111
26 362767
27 509319
28 715422
29 993681
30 1380793
31 1899630
32 2613064
33 3564177
34 4857631
35 6572314
36 8884973
37 11930363
38 16002853

List of values

[1, 1, 3, 6, 14, 25, 52, 89, 167, 279, 486, 786, 1322, 2069, 3326, 5128, 8004, 12055, 18384, 27203, 40588, 59186, 86645, 124583, 179784, 255111, 362767, 509319, 715422, 993681, 1380793, 1899630, 2613064, 3564177, 4857631, 6572314, 8884973, 11930363, 16002853]