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.

A236308 Number of primes q < prime(n)/2 such that the Catalan number C(q) is a primitive root modulo prime(n).

Table of values

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

List of values

[0, 0, 1, 1, 1, 1, 1, 1, 4, 2, 1, 4, 1, 3, 3, 5, 5, 5, 2, 4, 5, 4, 10, 4, 7, 7, 4, 7, 4, 9, 5, 6, 10, 9, 7, 5, 5, 12, 12, 13, 12, 4, 10, 7, 13, 4, 7, 10, 18, 9, 14, 13, 9, 9, 15, 17, 16, 8, 9, 12, 10, 19, 13, 10, 14, 14, 13, 6, 18, 18, 14, 24, 13, 16, 9, 22, 20, 12, 23, 15]