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.

A320535 Number of solutions to (x+1)^p - x^p == 1 (mod p^2) in the range 1 <= x <= p - 2, p = prime(n).

Table of values

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

List of values

[0, 0, 0, 2, 0, 2, 0, 2, 0, 0, 2, 2, 0, 2, 0, 0, 12, 2, 2, 0, 2, 8, 6, 0, 2, 0, 2, 0, 2, 0, 2, 0, 0, 2, 0, 2, 2, 2, 0, 0, 6, 2, 0, 8, 0, 2, 2, 2, 6, 2, 0, 0, 2, 0, 0, 0, 0, 2, 2, 0, 2, 0, 2, 0, 2, 0, 2, 8, 0, 2, 0, 0, 2, 2, 2, 0, 0, 2, 0, 2, 6, 8, 0, 2, 2, 6, 0]