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.

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

Table of values

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

List of values

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