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.

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

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.