A322974 - cp's OEIS frontend

A322974 Lexicographically earliest such sequence a that a(i) = a(j) => f(i) = f(j) for all i, j, where f(1) = 0, f(2) = 1, f(n) = 3 if A009191(n) == 1 and f(n) = A049820(n) for all other numbers > 2.

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

[1, 2, 3, 3, 3, 4, 3, 5, 6, 6, 3, 6, 3, 7, 3, 3, 3, 8, 3, 9, 3, 10, 3, 11, 3, 12, 3, 12, 3, 12, 3, 13, 3, 14, 3, 15, 3, 16, 3, 17, 3, 16, 3, 18, 19, 20, 3, 18, 3, 21, 3, 22, 3, 22, 3, 23, 3, 24, 3, 23, 3, 25, 26, 3, 3, 25, 3, 27, 3, 27, 3, 28, 3, 29, 30, 29, 3, 29, 3, 29, 3, 31, 3, 32, 3, 33, 3, 34, 3, 31, 3, 35, 3, 36, 3, 37, 3, 38, 39, 3, 3, 40, 3, 41, 3]

cp's OEIS Frontend

A322974 Lexicographically earliest such sequence a that a(i) = a(j) => f(i) = f(j) for all i, j, where f(1) = 0, f(2) = 1, f(n) = 3 if A009191(n) == 1 and f(n) = A049820(n) for all other numbers > 2.

Table of values

List of values

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

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

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