A372570 - cp's OEIS frontend

A372570 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = [A009194(n), A009195(n), A009223(n), A322361(n), A342671(n)], for all i, j >= 1.

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

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

cp's OEIS Frontend

A372570 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = [A009194(n), A009195(n), A009223(n), A322361(n), A342671(n)], for all i, j >= 1.

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

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

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