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.

A242210 Number of primes p < prime(n) such that the Bernoulli number B_{p-1} is a primitive root modulo prime(n).

Table of values

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

List of values

[0, 0, 1, 2, 1, 2, 2, 1, 4, 2, 3, 6, 3, 2, 5, 6, 5, 7, 4, 6, 6, 10, 11, 12, 8, 10, 9, 12, 10, 13, 9, 9, 10, 10, 17, 11, 7, 11, 18, 22, 15, 11, 12, 15, 21, 15, 10, 15, 23, 18, 26, 15, 15, 22, 26, 22, 25, 19, 26, 22, 22, 20, 17, 23, 20, 28, 17, 18, 28, 22]

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

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