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.

A213206 Largest order of permutation without a 2-cycle of n elements. Equivalently, largest LCM of partitions of n without parts =2.

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 4
5 5
6 6
7 12
8 15
9 20
10 21
11 30
12 60
13 60
14 84
15 105
16 140
17 140
18 210
19 420
20 420
21 420
22 420
23 840
24 840
25 1260
26 1260
27 1540
28 1540
29 2520
30 4620
31 4620
32 5460
33 5460
34 9240
35 9240
36 13860
37 13860
38 16380
39 16380
40 27720
41 27720
42 32760
43 60060
44 60060
45 60060
46 60060
47 120120
48 120120
49 180180
50 180180
51 180180

List of values

[1, 1, 1, 3, 4, 5, 6, 12, 15, 20, 21, 30, 60, 60, 84, 105, 140, 140, 210, 420, 420, 420, 420, 840, 840, 1260, 1260, 1540, 1540, 2520, 4620, 4620, 5460, 5460, 9240, 9240, 13860, 13860, 16380, 16380, 27720, 27720, 32760, 60060, 60060, 60060, 60060, 120120, 120120, 180180, 180180, 180180]