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.

A237121 Number of primes p < prime(n)/2 such that P(p) is a primitive root modulo prime(n), where P(.) is the partition function given by A000041.

Table of values

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

List of values

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