cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A234972 Least prime p < prime(n) such that 2^p - 1 is a primitive root modulo prime(n), or 0 if such a prime p does not exist.

Table of values

n a(n)
1 0
2 0
3 2
4 2
5 3
6 3
7 2
8 2
9 3
10 2
11 2
12 17
13 3
14 2
15 5
16 2
17 5
18 3
19 3
20 3
21 5
22 2
23 11
24 2
25 3
26 2
27 13
28 3
29 7
30 2
31 2
32 5
33 2
34 2
35 2
36 3
37 11
38 2
39 11
40 2
41 3
42 7
43 7
44 7
45 2
46 2
47 2
48 2
49 5
50 3
51 2
52 3
53 3
54 7
55 2
56 3
57 2
58 11
59 5
60 2
61 2
62 2
63 5
64 5
65 5
66 2
67 2
68 5
69 3
70 3
71 2
72 3
73 7
74 7
75 2
76 7
77 2
78 3
79 2
80 7
81 5
82 31
83 3
84 3
85 5
86 3
87 2
88 5
89 2
90 2
91 5
92 5
93 2
94 3
95 3
96 5
97 2
98 2
99 7
100 7

List of values

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