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.

A242830 For p = prime(n), a(n) = number of bases 1 < b < p such that b^(p-1) == 1 (mod p^2).

Table of values

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

List of values

[0, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 2, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 2, 2, 1, 0, 0, 1, 0, 2, 0, 0, 0, 1, 1, 0, 1, 1, 2, 1, 0, 2, 1, 0, 1, 0, 1, 1, 3, 0, 0, 1, 1, 1, 1, 0, 2, 0, 3, 0, 2, 2, 2, 2, 2, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 2, 0, 0, 4, 0, 1]