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.

A308746 a(1) = 1, and for n > 1, a(n) is the greatest k > 0 such that (a(1), ..., a(n-1)) can be split into k chunks of contiguous terms and those chunks have the same sum.

Table of values

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

List of values

[1, 1, 2, 2, 3, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 2, 4, 2, 5, 1, 6, 7, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 2, 4, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 5, 1, 1, 1, 2, 2, 2, 2, 2, 6, 2, 2, 2, 4, 2, 7, 1, 2, 2, 2, 2, 1, 1, 8, 2, 2, 3, 3, 9, 3, 3, 3, 10, 2, 2, 2]