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.

A237594 Number of primes p < prime(n)/2 such that the Bell number B(p) is a primitive root modulo prime(n).

Table of values

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

List of values

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