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.

A200219 Number of solutions of the equation x^n + (x+1)^n = (x+2)^n (mod n) for x = 0..n-1.

Table of values

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

List of values

[1, 1, 1, 2, 1, 2, 1, 4, 3, 2, 1, 4, 1, 2, 0, 8, 1, 6, 1, 4, 1, 2, 1, 8, 0, 2, 9, 2, 1, 4, 1, 16, 0, 2, 0, 12, 1, 2, 0, 8, 1, 4, 1, 2, 3, 2, 1, 16, 7, 10, 2, 2, 1, 18, 0, 8, 0, 2, 1, 8, 1, 2, 3, 32, 2, 4, 1, 4, 0, 2, 1, 24, 1, 2, 0, 4, 6, 4, 1, 16, 27, 2, 1, 8]