A334868 - cp's OEIS frontend

A334868 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j) for all i, j >= 1, where f(1) = 0 and for n > 1, f(n) = -1 if n is in A050376, and f(n) = A334870(n) otherwise.

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

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

cp's OEIS Frontend

A334868 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j) for all i, j >= 1, where f(1) = 0 and for n > 1, f(n) = -1 if n is in A050376, and f(n) = A334870(n) otherwise.

Table of values

List of values

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

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

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