A373595 - cp's OEIS frontend

A373595 Lexicographically earliest infinite sequence such that for all i, j >= 1, a(i) = a(j) => f(i) = f(j), where f(n<=3) = n, f(p) = 0 for primes p > 3, and for composite n, f(n) = [A007949(n), A373591(n), A373592(n)].

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

[1, 2, 3, 4, 5, 6, 5, 7, 8, 4, 5, 9, 5, 10, 6, 11, 5, 12, 5, 7, 13, 4, 5, 14, 4, 10, 15, 16, 5, 9, 5, 17, 6, 4, 10, 18, 5, 10, 13, 11, 5, 19, 5, 7, 12, 4, 5, 20, 21, 7, 6, 16, 5, 22, 4, 23, 13, 4, 5, 14, 5, 10, 24, 25, 10, 9, 5, 7, 6, 16, 5, 26, 5, 10, 9, 16, 10, 19, 5, 17, 27, 4, 5, 28, 4, 10, 6, 11, 5, 18, 21, 7, 13, 4, 10, 29, 5, 30, 12, 11, 5, 9, 5, 23, 19]

cp's OEIS Frontend

A373595 Lexicographically earliest infinite sequence such that for all i, j >= 1, a(i) = a(j) => f(i) = f(j), where f(n<=3) = n, f(p) = 0 for primes p > 3, and for composite n, f(n) = [A007949(n), A373591(n), A373592(n)].

Table of values

List of values

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

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

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