A091787 - cp's OEIS frontend

A091787 a(1) = 2. To get a(n+1), write the string a(1)a(2)...a(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence so far. Then a(n+1) = max(k,2).

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

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

cp's OEIS Frontend

A091787 a(1) = 2. To get a(n+1), write the string a(1)a(2)...a(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence so far. Then a(n+1) = max(k,2).

Table of values

List of values

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

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

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