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.

A360387 a(1) = 1, and for n > 1, a(n) is the number of ways that a(1..n-1) can be divided into contiguous subsequences of equal sum.

Table of values

n a(n)
1 1
2 1
3 2
4 2
5 2
6 3
7 1
8 3
9 1
10 3
11 1
12 2
13 2
14 4
15 2
16 2
17 4
18 3
19 1
20 4
21 3
22 1
23 6
24 1
25 1
26 3
27 1
28 4
29 4
30 1
31 1
32 1
33 1
34 5
35 1
36 2
37 5
38 1
39 1
40 1
41 3
42 1
43 1
44 1
45 2
46 6
47 1
48 1
49 2
50 1
51 1
52 3
53 1
54 4
55 1
56 2
57 1
58 5
59 1
60 1
61 1
62 5
63 1
64 1
65 1
66 3
67 1
68 2
69 2
70 7
71 1
72 2
73 2
74 3
75 1
76 6
77 1
78 1
79 4
80 2
81 2
82 4
83 3
84 1
85 3
86 1
87 2

List of values

[1, 1, 2, 2, 2, 3, 1, 3, 1, 3, 1, 2, 2, 4, 2, 2, 4, 3, 1, 4, 3, 1, 6, 1, 1, 3, 1, 4, 4, 1, 1, 1, 1, 5, 1, 2, 5, 1, 1, 1, 3, 1, 1, 1, 2, 6, 1, 1, 2, 1, 1, 3, 1, 4, 1, 2, 1, 5, 1, 1, 1, 5, 1, 1, 1, 3, 1, 2, 2, 7, 1, 2, 2, 3, 1, 6, 1, 1, 4, 2, 2, 4, 3, 1, 3, 1, 2]