A242213 - cp's OEIS frontend

A242213 Least prime p < prime(n) such that the Bernoulli number B_{p-1} is a primitive root modulo prime(n), or 0 if such a prime p does not exist.

n	a(n)
1	0
2	0
3	2
4	2
5	3
6	2
7	3
8	17
9	2
10	2
11	7
12	2
13	3
14	19
15	2
16	2
17	3
18	2
19	17
20	2
21	7
22	2
23	3
24	3
25	13
26	2
27	2
28	3
29	3
30	3
31	3
32	3
33	3
34	5
35	2
36	3
37	3
38	7
39	2
40	2
41	3
42	2
43	2
44	5
45	2
46	2
47	5
48	3
49	3
50	3
51	3
52	2
53	7
54	3
55	3
56	2
57	2
58	2
59	3
60	5
61	11
62	2
63	13
64	2
65	11
66	2
67	5
68	17
69	3
70	2

[0, 0, 2, 2, 3, 2, 3, 17, 2, 2, 7, 2, 3, 19, 2, 2, 3, 2, 17, 2, 7, 2, 3, 3, 13, 2, 2, 3, 3, 3, 3, 3, 3, 5, 2, 3, 3, 7, 2, 2, 3, 2, 2, 5, 2, 2, 5, 3, 3, 3, 3, 2, 7, 3, 3, 2, 2, 2, 3, 5, 11, 2, 13, 2, 11, 2, 5, 17, 3, 2]

cp's OEIS Frontend

A242213 Least prime p < prime(n) such that the Bernoulli number B_{p-1} is a primitive root modulo prime(n), or 0 if such a prime p does not exist.

Table of values

List of values

n	a(n)
1	0
2	0
3	2
4	2
5	3
6	2
7	3
8	17
9	2
10	2
11	7
12	2
13	3
14	19
15	2
16	2
17	3
18	2
19	17
20	2
21	7
22	2
23	3
24	3
25	13
26	2
27	2
28	3
29	3
30	3
31	3
32	3
33	3
34	5
35	2
36	3
37	3
38	7
39	2
40	2
41	3
42	2
43	2
44	5
45	2
46	2
47	5
48	3
49	3
50	3
51	3
52	2
53	7
54	3
55	3
56	2
57	2
58	2
59	3
60	5
61	11
62	2
63	13
64	2
65	11
66	2
67	5
68	17
69	3
70	2

n	a(n)
1	0
2	0
3	2
4	2
5	3
6	2
7	3
8	17
9	2
10	2
11	7
12	2
13	3
14	19
15	2
16	2
17	3
18	2
19	17
20	2
21	7
22	2
23	3
24	3
25	13
26	2
27	2
28	3
29	3
30	3
31	3
32	3
33	3
34	5
35	2
36	3
37	3
38	7
39	2
40	2
41	3
42	2
43	2
44	5
45	2
46	2
47	5
48	3
49	3
50	3
51	3
52	2
53	7
54	3
55	3
56	2
57	2
58	2
59	3
60	5
61	11
62	2
63	13
64	2
65	11
66	2
67	5
68	17
69	3
70	2

n	a(n)
1	0
2	0
3	2
4	2
5	3
6	2
7	3
8	17
9	2
10	2
11	7
12	2
13	3
14	19
15	2
16	2
17	3
18	2
19	17
20	2
21	7
22	2
23	3
24	3
25	13
26	2
27	2
28	3
29	3
30	3
31	3
32	3
33	3
34	5
35	2
36	3
37	3
38	7
39	2
40	2
41	3
42	2
43	2
44	5
45	2
46	2
47	5
48	3
49	3
50	3
51	3
52	2
53	7
54	3
55	3
56	2
57	2
58	2
59	3
60	5
61	11
62	2
63	13
64	2
65	11
66	2
67	5
68	17
69	3
70	2