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.

A225628 a(n) = lcm(A225627(n),p1,p2,...,pk) for such a partition {p1+p2+...+pk} of n which 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 60
6 60
7 420
8 840
9 1260
10 840
11 4620
12 4620
13 8580
14 16380
15 60060
16 60060
17 92820
18 92820
19 175560
20 263340
21 360360
22 360360
23 753480
24 2762760
25 6126120
26 6126120
27 8953560
28 6846840
29 13665960
30 58198140
31 58198140
32 78738660
33 78738660
34 157477320
35 157477320

List of values

[1, 1, 2, 6, 12, 60, 60, 420, 840, 1260, 840, 4620, 4620, 8580, 16380, 60060, 60060, 92820, 92820, 175560, 263340, 360360, 360360, 753480, 2762760, 6126120, 6126120, 8953560, 6846840, 13665960, 58198140, 58198140, 78738660, 78738660, 157477320, 157477320]