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.

A092331 For S a string of numbers, let F(S) = the sum of those numbers. Let a(1)=1. For n>1, a(n) is the largest k such that the string a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k], where each y_i is positive (but not necessarily all the same) length and F(y_i)=F(y_j) for all i,j<=k.

Table of values

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

List of values

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