A328767 - cp's OEIS frontend

A328767 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where for n>1, f(n) = [A003415(i), A328382(i)], and f(1) = 1.

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

[1, 2, 2, 3, 2, 4, 2, 5, 6, 7, 2, 8, 2, 9, 10, 11, 2, 12, 2, 13, 14, 15, 2, 16, 14, 17, 18, 19, 2, 20, 2, 21, 22, 23, 24, 25, 2, 26, 27, 28, 2, 29, 2, 30, 31, 32, 2, 33, 22, 34, 35, 36, 2, 37, 38, 39, 40, 41, 2, 42, 2, 43, 44, 45, 46, 47, 2, 48, 49, 50, 2, 51, 2, 52, 53, 54, 46, 55, 2, 56, 57, 58, 2, 59, 60, 61, 62, 63, 2, 64, 65, 66, 67, 68, 69, 70, 2, 71, 72, 73, 2, 74, 2]

cp's OEIS Frontend

A328767 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where for n>1, f(n) = [A003415(i), A328382(i)], and f(1) = 1.

Table of values

List of values

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

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

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