A373593 - cp's OEIS frontend

A373593 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), A046523(A248909(n)), A046523(A343430(n))].

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

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

cp's OEIS Frontend

A373593 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), A046523(A248909(n)), A046523(A343430(n))].

Table of values

List of values

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

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

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