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.

A328411 Largest 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 12
2 30
3 42
4 32
5 66
6 90
7 0
8 102
9 114
10 150
11 138
12 0
13 0
14 174
15 198
16 128
17 0
18 270
19 0
20 246
21 294
22 230
23 282
24 306
25 0
26 318
27 324
28 0
29 354
30 450
31 0
32 256
33 414
34 0
35 426
36 438
37 0
38 0
39 474
40 374
41 498
42 522
43 0
44 534
45 594
46 470
47 0
48 582
49 0
50 750
51 618
52 0
53 642
54 810
55 726
56 678
57 0
58 590
59 0
60 738
61 0
62 0
63 762
64 512

List of values

[12, 30, 42, 32, 66, 90, 0, 102, 114, 150, 138, 0, 0, 174, 198, 128, 0, 270, 0, 246, 294, 230, 282, 306, 0, 318, 324, 0, 354, 450, 0, 256, 414, 0, 426, 438, 0, 0, 474, 374, 498, 522, 0, 534, 594, 470, 0, 582, 0, 750, 618, 0, 642, 810, 726, 678, 0, 590, 0, 738, 0, 0, 762, 512]