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.

A243164 Number of primes p < n such that p*n is a primitive root modulo prime(n).

Table of values

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

List of values

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

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

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