A321992 - cp's OEIS frontend

A321992 a(n) is the least prime q different from p = prime(n) such that 2^(q-1) == 1 (mod p), or 0 if no such prime exists.

n	a(n)
1	0
2	5
3	13
4	13
5	31
6	37
7	41
8	37
9	67
10	113
11	11
12	73
13	61
14	29
15	139
16	157
17	233
18	181
19	199
20	211
21	19
22	157
23	739
24	23
25	193
26	401
27	307
28	743
29	37
30	29
31	29
32	521
33	409
34	277
35	593
36	31
37	53
38	487
39	499
40	1033
41	1069
42	541
43	571
44	97
45	1373
46	397
47	421
48	149
49	1583
50	457
51	59
52	953
53	73
54	101
55	17
56	787
57	1609
58	541
59	461

[0, 5, 13, 13, 31, 37, 41, 37, 67, 113, 11, 73, 61, 29, 139, 157, 233, 181, 199, 211, 19, 157, 739, 23, 193, 401, 307, 743, 37, 29, 29, 521, 409, 277, 593, 31, 53, 487, 499, 1033, 1069, 541, 571, 97, 1373, 397, 421, 149, 1583, 457, 59, 953, 73, 101, 17, 787, 1609, 541, 461]

cp's OEIS Frontend

A321992 a(n) is the least prime q different from p = prime(n) such that 2^(q-1) == 1 (mod p), or 0 if no such prime exists.

Table of values

List of values