A352394 - cp's OEIS frontend

A352394 a(n) = n for n <= 3; let i = a(n-2) and j = a(n-1); a(n+1) = least k not already in the sequence such that (j, k) = 1 and (i, k) = m > 1 and only one of either omega(i) or omega(k) exceed omega(m), where omega = A001221, and either i | k or k | i.

n	a(n)
1	1
2	2
3	3
4	10
5	21
6	5
7	7
8	15
9	14
10	165
11	182
12	11
13	13
14	22
15	39
16	110
17	273
18	55
19	91
20	220
21	819
22	4
23	9
24	20
25	63
26	260
27	693
28	26
29	33
30	130
31	231
32	65
33	77
34	195
35	154
36	3315
37	2926
38	17
39	19
40	34
41	57
42	170
43	399
44	85
45	133
46	255
47	266
48	51
49	38
50	357
51	190
52	119
53	95
54	238
55	285
56	2618
57	3705
58	187
59	247

[1, 2, 3, 10, 21, 5, 7, 15, 14, 165, 182, 11, 13, 22, 39, 110, 273, 55, 91, 220, 819, 4, 9, 20, 63, 260, 693, 26, 33, 130, 231, 65, 77, 195, 154, 3315, 2926, 17, 19, 34, 57, 170, 399, 85, 133, 255, 266, 51, 38, 357, 190, 119, 95, 238, 285, 2618, 3705, 187, 247]

cp's OEIS Frontend

A352394 a(n) = n for n <= 3; let i = a(n-2) and j = a(n-1); a(n+1) = least k not already in the sequence such that (j, k) = 1 and (i, k) = m > 1 and only one of either omega(i) or omega(k) exceed omega(m), where omega = A001221, and either i | k or k | i.

Table of values

List of values