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.

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

List of values

[0, 1, 1, 0, 2, 3, 2, 2, 2, 4, 1, 3, 5, 1, 4, 3, 3, 4, 2, 2, 3, 2, 4, 4, 2, 5, 4, 4, 2, 2, 2, 4, 4, 6, 6, 4, 3, 3, 7, 6, 6, 2, 4, 3, 5, 3, 2, 3, 8, 3, 4, 4, 1, 3, 5, 5, 6, 5, 6, 4, 3, 5, 1, 1, 3, 4, 4, 2, 7, 2, 4, 4, 2, 8, 3, 7, 7, 3, 5, 4, 6, 1, 3, 4, 4, 7, 5, 4, 6, 2]