A092335 - cp's OEIS frontend

A092335 Let a(1)=1. For n>1, a(n) is the greatest k such that 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 and equal length and for any i,j, y_i and y_j agree at every other term starting from the left (see example).

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

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

cp's OEIS Frontend

A092335 Let a(1)=1. For n>1, a(n) is the greatest k such that 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 and equal length and for any i,j, y_i and y_j agree at every other term starting from the left (see example).

Table of values

List of values

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

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

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