A091976 - cp's OEIS frontend

A091976 a(1)=1; for n>1, a(n) = largest integer k such that the word a(1)a(2)a(3)...a(n-1) is of the form x(y_1)(y_2)...(y_k) where each y_i is of positive length and any y_i and y_j are related by y_i=P(y_j) for some permutation P.

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	2
21	2
22	3
23	2
24	2
25	2
26	3
27	3
28	2
29	2
30	4
31	1
32	1
33	2
34	1
35	1
36	2
37	2
38	2
39	3
40	1
41	1
42	2
43	1
44	1
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	2
59	2
60	4
61	2
62	2
63	2
64	3
65	2
66	1
67	1
68	2
69	2
70	2
71	3
72	2
73	2
74	2
75	3
76	2
77	2
78	2
79	3
80	3
81	2
82	2
83	4
84	2
85	2
86	2
87	3
88	2
89	2
90	2
91	3
92	2
93	2
94	2
95	3
96	3
97	2
98	2
99	4
100	2
101	2
102	2
103	3
104	2
105	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, 4, 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, 4, 2, 2, 2, 3, 2, 1, 1, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 3, 2, 2, 4, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 3, 2, 2, 4, 2, 2, 2, 3, 2, 2]

cp's OEIS Frontend

A091976 a(1)=1; for n>1, a(n) = largest integer k such that the word a(1)a(2)a(3)...a(n-1) is of the form x(y_1)(y_2)...(y_k) where each y_i is of positive length and any y_i and y_j are related by y_i=P(y_j) for some permutation P.

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	2
21	2
22	3
23	2
24	2
25	2
26	3
27	3
28	2
29	2
30	4
31	1
32	1
33	2
34	1
35	1
36	2
37	2
38	2
39	3
40	1
41	1
42	2
43	1
44	1
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	2
59	2
60	4
61	2
62	2
63	2
64	3
65	2
66	1
67	1
68	2
69	2
70	2
71	3
72	2
73	2
74	2
75	3
76	2
77	2
78	2
79	3
80	3
81	2
82	2
83	4
84	2
85	2
86	2
87	3
88	2
89	2
90	2
91	3
92	2
93	2
94	2
95	3
96	3
97	2
98	2
99	4
100	2
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	2
9	3
10	1
11	1
12	2
13	1
14	1
15	2
16	2
17	2
18	3
19	2
20	2
21	2
22	3
23	2
24	2
25	2
26	3
27	3
28	2
29	2
30	4
31	1
32	1
33	2
34	1
35	1
36	2
37	2
38	2
39	3
40	1
41	1
42	2
43	1
44	1
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	2
59	2
60	4
61	2
62	2
63	2
64	3
65	2
66	1
67	1
68	2
69	2
70	2
71	3
72	2
73	2
74	2
75	3
76	2
77	2
78	2
79	3
80	3
81	2
82	2
83	4
84	2
85	2
86	2
87	3
88	2
89	2
90	2
91	3
92	2
93	2
94	2
95	3
96	3
97	2
98	2
99	4
100	2
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	2
9	3
10	1
11	1
12	2
13	1
14	1
15	2
16	2
17	2
18	3
19	2
20	2
21	2
22	3
23	2
24	2
25	2
26	3
27	3
28	2
29	2
30	4
31	1
32	1
33	2
34	1
35	1
36	2
37	2
38	2
39	3
40	1
41	1
42	2
43	1
44	1
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	2
59	2
60	4
61	2
62	2
63	2
64	3
65	2
66	1
67	1
68	2
69	2
70	2
71	3
72	2
73	2
74	2
75	3
76	2
77	2
78	2
79	3
80	3
81	2
82	2
83	4
84	2
85	2
86	2
87	3
88	2
89	2
90	2
91	3
92	2
93	2
94	2
95	3
96	3
97	2
98	2
99	4
100	2
101	2
102	2
103	3
104	2
105	2