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.

A206589 Number of solutions (n,k) of p(k+1)=p(n+1) (mod n), where 1<=k

Table of values

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

List of values

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