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.

A328412 Number of solutions to (Z/mZ)* = C_2 X C_(2n), where (Z/mZ)* is the multiplicative group of integers modulo m.

Table of values

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

List of values

[2, 4, 4, 1, 3, 7, 0, 4, 4, 5, 3, 0, 0, 3, 7, 1, 0, 7, 0, 3, 6, 2, 3, 4, 0, 3, 1, 0, 3, 11, 0, 1, 7, 0, 3, 3, 0, 0, 3, 2, 3, 8, 0, 3, 4, 2, 0, 3, 0, 6, 3, 0, 3, 5, 5, 3, 0, 2, 0, 4, 0, 0, 3, 1, 3, 4, 0, 3, 7, 4, 0, 4, 0, 3, 3, 0, 0, 12, 0, 0, 4, 2, 3, 0, 0, 3, 4, 2, 3, 9, 0, 0]