A092334 - cp's OEIS frontend

A092334 For S a finite string of numbers, let M(S) denote the maximal number among them. Let a(1)=1. For n>1, a(n) is the greatest 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 of positive (but not necessarily equal) length and M(y_i)=M(y_j) for all i,j.

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

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

cp's OEIS Frontend

Table of values

List of values

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

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

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