A083566 - cp's OEIS frontend

A083566 a(1) = 1; for n>1, a(n) = smallest odd number > a(n-1) such that a(1)...a(n) + 2 is a prime.

n	a(n)
1	1
2	3
3	5
4	7
5	9
6	15
7	19
8	25
9	27
10	53
11	57
12	65
13	71
14	87
15	101
16	151
17	195
18	247
19	253
20	255
21	277
22	289
23	291
24	301
25	321
26	355
27	361
28	443
29	455
30	461
31	491
32	531
33	533
34	541
35	599
36	603
37	619
38	635
39	647
40	667
41	805
42	817
43	871
44	1003
45	1011
46	1179
47	1205
48	1223
49	1327
50	1357
51	1531
52	1551
53	1603
54	1619

[1, 3, 5, 7, 9, 15, 19, 25, 27, 53, 57, 65, 71, 87, 101, 151, 195, 247, 253, 255, 277, 289, 291, 301, 321, 355, 361, 443, 455, 461, 491, 531, 533, 541, 599, 603, 619, 635, 647, 667, 805, 817, 871, 1003, 1011, 1179, 1205, 1223, 1327, 1357, 1531, 1551, 1603, 1619]

cp's OEIS Frontend

A083566 a(1) = 1; for n>1, a(n) = smallest odd number > a(n-1) such that a(1)...a(n) + 2 is a prime.

Table of values

List of values

cp's OEIS Frontend

A083566 a(1) = 1; for n>1, a(n) = smallest odd number > a(n-1) such that a(1)*...*a(n) + 2 is a prime.

Table of values

List of values

A083566 a(1) = 1; for n>1, a(n) = smallest odd number > a(n-1) such that a(1)...a(n) + 2 is a prime.