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.

A225627 a(n) = lcm(A000793(n),p1,p2,...,pk) for such a partition {p1+p2+...+pk} of n that maximizes this value among all partitions of n.

Table of values

n a(n)
0 1
1 1
2 2
3 6
4 12
5 30
6 30
7 84
8 120
9 180
10 210
11 420
12 660
13 780
14 1260
15 4620
16 5460
17 5460
18 5460
19 9240
20 13860
21 13860
22 16380
23 32760
24 120120
25 180180
26 180180
27 235620
28 180180
29 471240
30 1021020
31 1021020
32 1141140
33 1141140
34 2282280
35 2282280
36 4476780
37 4476780
38 6846840
39 6846840

List of values

[1, 1, 2, 6, 12, 30, 30, 84, 120, 180, 210, 420, 660, 780, 1260, 4620, 5460, 5460, 5460, 9240, 13860, 13860, 16380, 32760, 120120, 180180, 180180, 235620, 180180, 471240, 1021020, 1021020, 1141140, 1141140, 2282280, 2282280, 4476780, 4476780, 6846840, 6846840]