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.

A225652 a(n) = (1/n) * lcm(n,p1,p2,...,pk) for that partition of n which maximizes this value among all partitions [p1,p2,...,pk] of n.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 6
6 5
7 12
8 15
9 20
10 21
11 30
12 35
13 60
14 45
15 56
16 105
17 210
18 77
19 420
20 99
21 220
22 315
23 840
24 385
25 924
26 1155
27 1540
28 585
29 2520
30 364
31 4620
32 3465
33 3640
34 4620
35 3432
36 5005
37 13860
38 8190
39 6160
40 9009
41 30030
42 4290
43 60060
44 9945
45 12376
46 45045
47 120120
48 17017
49 51480
50 36036

List of values

[1, 1, 2, 3, 6, 5, 12, 15, 20, 21, 30, 35, 60, 45, 56, 105, 210, 77, 420, 99, 220, 315, 840, 385, 924, 1155, 1540, 585, 2520, 364, 4620, 3465, 3640, 4620, 3432, 5005, 13860, 8190, 6160, 9009, 30030, 4290, 60060, 9945, 12376, 45045, 120120, 17017, 51480, 36036]