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.

A319794 Number of ways to split a strict integer partition of n into consecutive subsequences with weakly decreasing sums.

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 3
5 5
6 9
7 11
8 15
9 20
10 31
11 37
12 52
13 64
14 85
15 111
16 141
17 175
18 225
19 279
20 346
21 437
22 532
23 654
24 802
25 979
26 1182
27 1438
28 1740
29 2083
30 2502
31 2996
32 3565
33 4245
34 5043
35 5950
36 7068
37 8303
38 9772
39 11449
40 13452
41 15681
42 18355
43 21338
44 24855
45 28846
46 33509
47 38687
48 44819
49 51644

List of values

[1, 1, 1, 3, 3, 5, 9, 11, 15, 20, 31, 37, 52, 64, 85, 111, 141, 175, 225, 279, 346, 437, 532, 654, 802, 979, 1182, 1438, 1740, 2083, 2502, 2996, 3565, 4245, 5043, 5950, 7068, 8303, 9772, 11449, 13452, 15681, 18355, 21338, 24855, 28846, 33509, 38687, 44819, 51644]