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.

A087561 Number of solutions to x^2 + 2y^2 == 0 (mod n).

Table of values

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

List of values

[1, 2, 5, 4, 1, 10, 1, 8, 21, 2, 21, 20, 1, 2, 5, 16, 33, 42, 37, 4, 5, 42, 1, 40, 25, 2, 81, 4, 1, 10, 1, 32, 105, 66, 1, 84, 1, 74, 5, 8, 81, 10, 85, 84, 21, 2, 1, 80, 49, 50, 165, 4, 1, 162, 21, 8, 185, 2, 117, 20, 1, 2, 21, 64, 1, 210, 133, 132, 5, 2, 1, 168, 145, 2, 125, 148, 21]

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

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