A091970 - cp's OEIS frontend

A091970 a(1) = 0; for n>1, find 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., k = the maximal number of repeating blocks at the end of the sequence so far; then a(n) = floor(k/2).

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

[0, 0, 1, 0, 0, 1, 1, 1, 1, 2, 0, 0, 1, 0, 0, 1, 1, 1, 1, 2, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 2, 0, 0, 1, 0, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 2, 0, 0, 1, 0, 0, 1, 1, 1, 1, 2, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 2, 0, 0, 1, 0, 0, 1, 1, 1, 1, 2]

cp's OEIS Frontend

A091970 a(1) = 0; for n>1, find 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., k = the maximal number of repeating blocks at the end of the sequence so far; then a(n) = floor(k/2).

Table of values

List of values

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

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

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