A305801 - cp's OEIS frontend

A305801 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = 0 if n is an odd prime, with f(n) = n for all other n.

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

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

cp's OEIS Frontend

A305801 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = 0 if n is an odd prime, with f(n) = n for all other n.

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

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

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