A190894 - cp's OEIS frontend

A190894 Auxiliary c(n) sequence used to prove some properties about Rowland's sequence. c(n) has the following recursive definition: c(1) = 5, c_(n+1) = c(n) + lfp(c(n)) - 1, where lpf(.) denotes the lowest prime factor of a number.

n	a(n)
1	5
2	9
3	11
4	21
5	23
6	45
7	47
8	93
9	95
10	99
11	101
12	201
13	203
14	209
15	219
16	221
17	233
18	465
19	467
20	933
21	935
22	939
23	941
24	1881
25	1883
26	1889
27	3777
28	3779
29	7557
30	7559
31	15117
32	15119
33	15131
34	30261
35	30263
36	30315
37	30317
38	30323
39	60645
40	60647
41	121293
42	121295
43	121299
44	121301
45	121401

[5, 9, 11, 21, 23, 45, 47, 93, 95, 99, 101, 201, 203, 209, 219, 221, 233, 465, 467, 933, 935, 939, 941, 1881, 1883, 1889, 3777, 3779, 7557, 7559, 15117, 15119, 15131, 30261, 30263, 30315, 30317, 30323, 60645, 60647, 121293, 121295, 121299, 121301, 121401]

cp's OEIS Frontend

A190894 Auxiliary c(n) sequence used to prove some properties about Rowland's sequence. c(n) has the following recursive definition: c(1) = 5, c_(n+1) = c(n) + lfp(c(n)) - 1, where lpf(.) denotes the lowest prime factor of a number.

Table of values

List of values