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.

A328410 Smallest m such that (Z/mZ)* = C_2 X C_(2n), or 0 if no such m exists, where (Z/mZ)* is the multiplicative group of integers modulo m.

Table of values

n a(n)
1 8
2 15
3 21
4 32
5 33
6 35
7 0
8 51
9 57
10 55
11 69
12 0
13 0
14 87
15 77
16 128
17 0
18 95
19 0
20 123
21 129
22 115
23 141
24 119
25 0
26 159
27 324
28 0
29 177
30 143
31 0
32 256
33 161
34 0
35 213
36 219
37 0
38 0
39 237
40 187
41 249
42 203
43 0
44 267
45 209
46 235
47 0
48 291
49 0
50 303
51 309
52 0
53 321
54 327
55 253
56 339
57 0
58 295
59 0
60 287
61 0
62 0
63 381
64 512
65 393
66 299
67 0

List of values

[8, 15, 21, 32, 33, 35, 0, 51, 57, 55, 69, 0, 0, 87, 77, 128, 0, 95, 0, 123, 129, 115, 141, 119, 0, 159, 324, 0, 177, 143, 0, 256, 161, 0, 213, 219, 0, 0, 237, 187, 249, 203, 0, 267, 209, 235, 0, 291, 0, 303, 309, 0, 321, 327, 253, 339, 0, 295, 0, 287, 0, 0, 381, 512, 393, 299, 0]