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.

A336128 Number of ways to split a strict composition of n into contiguous subsequences with different sums.

Table of values

n a(n)
0 1
1 1
2 1
3 5
4 5
5 9
6 29
7 37
8 57
9 89
10 265
11 309
12 521
13 745
14 1129
15 3005
16 3545
17 5685
18 8201
19 12265
20 16629
21 41369
22 48109
23 77265
24 107645
25 160681
26 214861
27 316913
28 644837
29 798861
30 1207445
31 1694269
32 2437689
33 3326705
34 4710397
35 6270513
36 12246521
37 14853625
38 22244569
39 30308033
40 43706705
41 57926577
42 82166105
43 107873221
44 148081785
45 257989961
46 320873065
47 458994657
48 628016225
49 875485585
50 1165065733

List of values

[1, 1, 1, 5, 5, 9, 29, 37, 57, 89, 265, 309, 521, 745, 1129, 3005, 3545, 5685, 8201, 12265, 16629, 41369, 48109, 77265, 107645, 160681, 214861, 316913, 644837, 798861, 1207445, 1694269, 2437689, 3326705, 4710397, 6270513, 12246521, 14853625, 22244569, 30308033, 43706705, 57926577, 82166105, 107873221, 148081785, 257989961, 320873065, 458994657, 628016225, 875485585, 1165065733]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.