A376865 - cp's OEIS frontend

A376865 a(1) = 1. Thereafter, if A007947(a(n-1)) is in A002110, a(n) = smallest prime not already a term (condition [A]). Otherwise, if q is the greatest prime < Gpf(a(n-1)) which does not divide a(n-1), a(n) is the least novel multiple of q,(condition [B]).

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

[1, 2, 3, 4, 5, 6, 7, 10, 9, 8, 11, 14, 15, 12, 13, 22, 21, 20, 18, 17, 26, 33, 28, 25, 24, 19, 34, 39, 44, 35, 27, 16, 23, 38, 51, 52, 55, 42, 30, 29, 46, 57, 68, 65, 66, 49, 40, 36, 31, 58, 69, 76, 85, 78, 77, 45, 32, 37, 62, 87, 92, 95, 102, 91, 88, 56, 50, 48]

cp's OEIS Frontend

A376865 a(1) = 1. Thereafter, if A007947(a(n-1)) is in A002110, a(n) = smallest prime not already a term (condition [A]). Otherwise, if q is the greatest prime < Gpf(a(n-1)) which does not divide a(n-1), a(n) is the least novel multiple of q,(condition [B]).

Table of values

List of values

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

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

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