A282027 - cp's OEIS frontend

A282027 a(n+1) = smallest prime p > a(n) such that p-1 divides a(1)a(2)...*a(n); or if no such prime p exists, then a(n+1) = smallest prime > a(n).

n	a(n)
1	2
2	3
3	7
4	43
5	47
6	283
7	659
8	1319
9	1699
10	9227
11	11887
12	55399
13	71359
14	159707
15	396719
16	558643
17	793439
18	794039
19	1117379
20	1117943
21	1143887
22	2235887
23	5554067
24	6707747
25	6863323
26	13734803
27	15667447
28	16663963
29	18214099
30	20123239
31	45196799
32	46954223
33	55937239
34	93908447

[2, 3, 7, 43, 47, 283, 659, 1319, 1699, 9227, 11887, 55399, 71359, 159707, 396719, 558643, 793439, 794039, 1117379, 1117943, 1143887, 2235887, 5554067, 6707747, 6863323, 13734803, 15667447, 16663963, 18214099, 20123239, 45196799, 46954223, 55937239, 93908447]

cp's OEIS Frontend

A282027 a(n+1) = smallest prime p > a(n) such that p-1 divides a(1)a(2)...*a(n); or if no such prime p exists, then a(n+1) = smallest prime > a(n).

Table of values

List of values

cp's OEIS Frontend

A282027 a(n+1) = smallest prime p > a(n) such that p-1 divides a(1)*a(2)*...*a(n); or if no such prime p exists, then a(n+1) = smallest prime > a(n).

Table of values

List of values

A282027 a(n+1) = smallest prime p > a(n) such that p-1 divides a(1)a(2)...*a(n); or if no such prime p exists, then a(n+1) = smallest prime > a(n).