A090822 - cp's OEIS frontend

A090822 Gijswijt's sequence: a(1) = 1; for n>1, a(n) = largest integer k such that the word a(1)a(2)...a(n-1) is of the form xy^k for words x and y (where y has positive length), i.e., the maximal number of repeating blocks at the end of the sequence so far.

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

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

cp's OEIS Frontend

A090822 Gijswijt's sequence: a(1) = 1; for n>1, a(n) = largest integer k such that the word a(1)a(2)...a(n-1) is of the form xy^k for words x and y (where y has positive length), i.e., the maximal number of repeating blocks at the end of the sequence so far.

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

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

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