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.

A225646 a(n) = lcm(n,p1,p2,...,pk) for such a partition of n which maximizes this value among all partitions {p1+p2+...pk} 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 330
12 420
13 780
14 630
15 840
16 1680
17 3570
18 1386
19 7980
20 1980
21 4620
22 6930
23 19320
24 9240
25 23100
26 30030
27 41580
28 16380
29 73080
30 10920
31 143220
32 110880
33 120120
34 157080
35 120120
36 180180
37 512820
38 311220
39 240240
40 360360
41 1231230
42 180180

List of values

[1, 1, 2, 6, 12, 30, 30, 84, 120, 180, 210, 330, 420, 780, 630, 840, 1680, 3570, 1386, 7980, 1980, 4620, 6930, 19320, 9240, 23100, 30030, 41580, 16380, 73080, 10920, 143220, 110880, 120120, 157080, 120120, 180180, 512820, 311220, 240240, 360360, 1231230, 180180]