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.

A336130 Number of ways to split a strict composition of n into contiguous subsequences all having the same sum.

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 3
5 5
6 15
7 13
8 23
9 27
10 73
11 65
12 129
13 133
14 241
15 375
16 519
17 617
18 1047
19 1177
20 1859
21 2871
22 3913
23 4757
24 7653
25 8761
26 13273
27 16155
28 28803
29 30461
30 50727
31 55741
32 87743
33 100707
34 152233
35 168425
36 308937
37 315973
38 500257
39 571743
40 871335
41 958265
42 1511583
43 1621273
44 2449259
45 3095511
46 4335385
47 4957877
48 7554717
49 8407537
50 12325993
51 14301411
52 20348691
53 22896077
54 33647199
55 40267141
56 56412983
57 66090291
58 93371665
59 106615841
60 155161833

List of values

[1, 1, 1, 3, 3, 5, 15, 13, 23, 27, 73, 65, 129, 133, 241, 375, 519, 617, 1047, 1177, 1859, 2871, 3913, 4757, 7653, 8761, 13273, 16155, 28803, 30461, 50727, 55741, 87743, 100707, 152233, 168425, 308937, 315973, 500257, 571743, 871335, 958265, 1511583, 1621273, 2449259, 3095511, 4335385, 4957877, 7554717, 8407537, 12325993, 14301411, 20348691, 22896077, 33647199, 40267141, 56412983, 66090291, 93371665, 106615841, 155161833]

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

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