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.

A242250 Least positive integer g < prime(n) such that g, 2^g - 1 and (g-1)! are all primitive roots modulo prime(n), or 0 if such a number g does not exist.

Table of values

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

List of values

[1, 0, 3, 5, 8, 11, 5, 13, 21, 10, 12, 22, 24, 34, 13, 31, 18, 6, 41, 11, 14, 53, 8, 6, 26, 3, 12, 5, 47, 10, 45, 10, 5, 32, 12, 6, 24, 3, 15, 3, 6, 41, 19, 10, 8, 30, 3, 67, 5, 35, 20, 13, 99, 19, 7, 7, 3, 118, 5, 15, 22, 3, 73, 59, 91, 8, 137, 46, 20, 55]