A329608 - cp's OEIS frontend

A329608 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = A329605(n) for all other n, except for odd primes p, f(p) = 0.

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

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

cp's OEIS Frontend

A329608 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = A329605(n) for all other n, except for odd primes p, f(p) = 0.

Table of values

List of values

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

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

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