A384503 - cp's OEIS frontend

A384503 Lexicographically earliest infinite sequence of distinct positive integers having the property that for any pair a(n-2) = i, a(n-1) = j of consecutive terms > 1, a(n) is the smallest novel k such that gcd(i,k) > 1 if gcd(i,j) = 1 or gcd(j,k) = 1 if gcd(i,j) > 1.

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

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

cp's OEIS Frontend

A384503 Lexicographically earliest infinite sequence of distinct positive integers having the property that for any pair a(n-2) = i, a(n-1) = j of consecutive terms > 1, a(n) is the smallest novel k such that gcd(i,k) > 1 if gcd(i,j) = 1 or gcd(j,k) = 1 if gcd(i,j) > 1.

Table of values

List of values

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

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

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