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.

A236306 Least prime p < prime(n) for which both p and p! are primitive roots modulo prime(n), or 0 if such a prime does not exist.

Table of values

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

List of values

[0, 2, 2, 0, 2, 2, 3, 2, 5, 2, 11, 2, 17, 5, 5, 2, 2, 2, 2, 13, 5, 3, 2, 3, 5, 2, 11, 2, 67, 3, 3, 2, 3, 2, 2, 13, 53, 2, 5, 2, 2, 2, 47, 5, 2, 3, 2, 3, 2, 29, 3, 7, 137, 11, 3, 5, 2, 59, 31, 13, 17, 2, 5, 23, 47, 2, 101, 23, 2, 2, 13, 7, 43, 2, 2, 5, 2, 109, 3, 127]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.