A354853 - cp's OEIS frontend

A354853 a(1) = 4, a(2) = 9; let i = a(n-2) and j = a(n-1); a(n+1) = k 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 neither i | k nor k | i.

n	a(n)
1	4
2	9
3	10
4	21
5	8
6	27
7	14
8	15
9	16
10	25
11	6
12	35
13	32
14	49
15	12
16	77
17	30
18	121
19	18
20	55
21	42
22	125
23	24
24	65
25	64
26	169
27	20
28	39
29	70
30	81
31	28
32	33
33	128
34	243
35	22
36	45
37	256
38	105
39	26
40	63
41	512
42	231
43	34
44	99
45	289
46	66
47	85
48	36
49	625
50	78
51	95
52	48
53	361
54	60
55	133
56	40
57	343
58	90
59	91
60	50
61	2197
62	110

[4, 9, 10, 21, 8, 27, 14, 15, 16, 25, 6, 35, 32, 49, 12, 77, 30, 121, 18, 55, 42, 125, 24, 65, 64, 169, 20, 39, 70, 81, 28, 33, 128, 243, 22, 45, 256, 105, 26, 63, 512, 231, 34, 99, 289, 66, 85, 36, 625, 78, 95, 48, 361, 60, 133, 40, 343, 90, 91, 50, 2197, 110]

cp's OEIS Frontend

A354853 a(1) = 4, a(2) = 9; let i = a(n-2) and j = a(n-1); a(n+1) = k 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 neither i | k nor k | i.

Table of values

List of values