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.

A305030 Number of pairs {k, m} with 0 <= k <= m such that binomial(2k,k) + binomial(2m,m) is not only a primitive root modulo prime(n) but also smaller than prime(n).

Table of values

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

List of values

[0, 1, 2, 1, 3, 2, 3, 2, 2, 5, 4, 2, 4, 3, 3, 7, 3, 3, 3, 3, 2, 2, 6, 4, 7, 9, 4, 8, 2, 5, 3, 8, 7, 9, 9, 4, 3, 6, 5, 9, 10, 5, 5, 5, 8, 3, 5, 7, 5, 4, 6, 4, 2, 5, 8, 7, 14, 6, 4, 9, 8, 7, 3, 5, 6, 11, 6, 5, 13, 8, 8, 8, 8, 4, 8, 7, 14, 6, 7, 7, 8, 8, 8, 5, 3, 8, 6, 5, 9, 5]