A063091 - cp's OEIS frontend

A063091 Prime(n) such that gcd(1+prime(n+1), 1+prime(n)) = gcd(-1+prime(n+1), -1+prime(n)).

n	a(n)
1	2
2	3
3	5
4	11
5	17
6	29
7	41
8	59
9	71
10	101
11	107
12	137
13	149
14	179
15	191
16	197
17	227
18	239
19	269
20	281
21	283
22	311
23	317
24	337
25	347
26	419
27	431
28	461
29	521
30	547
31	569
32	577
33	599
34	617
35	641
36	659
37	773
38	787
39	809
40	821
41	827
42	857
43	863
44	881
45	1019
46	1031
47	1049
48	1061
49	1091
50	1129
51	1151
52	1153

[2, 3, 5, 11, 17, 29, 41, 59, 71, 101, 107, 137, 149, 179, 191, 197, 227, 239, 269, 281, 283, 311, 317, 337, 347, 419, 431, 461, 521, 547, 569, 577, 599, 617, 641, 659, 773, 787, 809, 821, 827, 857, 863, 881, 1019, 1031, 1049, 1061, 1091, 1129, 1151, 1153]

cp's OEIS Frontend

A063091 Prime(n) such that gcd(1+prime(n+1), 1+prime(n)) = gcd(-1+prime(n+1), -1+prime(n)).

Table of values

List of values