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.

A242242 Least positive primitive root g < prime(n) modulo prime(n) with 2^g - 1 also a primitive root modulo prime(n), or 0 if such a number g does not exist.

Table of values

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

List of values

[1, 0, 2, 5, 2, 2, 3, 2, 5, 2, 3, 2, 6, 3, 5, 2, 2, 2, 2, 7, 5, 3, 2, 3, 5, 2, 5, 2, 6, 3, 3, 2, 3, 2, 2, 6, 5, 2, 5, 2, 2, 2, 19, 5, 2, 3, 2, 3, 2, 6, 3, 7, 7, 6, 3, 5, 2, 6, 5, 3, 3, 2, 5, 17, 10, 2, 3, 10, 2, 2]