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.

A000086 Number of solutions to x^2 - x + 1 == 0 (mod n).

Table of values

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

List of values

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