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.

A352567 a(n) = number of modules with n elements over the ring of integers in the imaginary quadratic field of discriminant -19.

Table of values

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

List of values

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