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.

A079612 Largest number m such that a^n == 1 (mod m) whenever a is coprime to m.

Table of values

n a(n)
1 2
2 24
3 2
4 240
5 2
6 504
7 2
8 480
9 2
10 264
11 2
12 65520
13 2
14 24
15 2
16 16320
17 2
18 28728
19 2
20 13200
21 2
22 552
23 2
24 131040
25 2
26 24
27 2
28 6960
29 2
30 171864
31 2
32 32640
33 2
34 24
35 2
36 138181680
37 2
38 24
39 2
40 1082400
41 2
42 151704
43 2
44 5520
45 2
46 1128
47 2
48 4455360
49 2
50 264
51 2
52 12720
53 2
54 86184
55 2
56 13920

List of values

[2, 24, 2, 240, 2, 504, 2, 480, 2, 264, 2, 65520, 2, 24, 2, 16320, 2, 28728, 2, 13200, 2, 552, 2, 131040, 2, 24, 2, 6960, 2, 171864, 2, 32640, 2, 24, 2, 138181680, 2, 24, 2, 1082400, 2, 151704, 2, 5520, 2, 1128, 2, 4455360, 2, 264, 2, 12720, 2, 86184, 2, 13920]