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.

A237112 Number of primes p < prime(n)/2 with p! a primitive root modulo prime(n).

Table of values

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

List of values

[0, 0, 1, 0, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 4, 4, 6, 4, 2, 3, 3, 4, 7, 9, 5, 7, 5, 8, 4, 7, 6, 7, 8, 7, 11, 8, 9, 7, 13, 10, 16, 4, 7, 8, 13, 9, 8, 12, 17, 10, 14, 12, 4, 10, 14, 15, 18, 8, 9, 8, 8, 18, 6, 8, 7, 16, 9, 11, 21, 15]