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.

A225656 a(n) = (1/n) * lcm(p1,p2,...,pk) for such a partition of n that this formula produces an integer and maximizes this value among all such partitions [p1,p2,...,pk] of n.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 3
11 1
12 5
13 1
14 6
15 7
16 1
17 1
18 10
19 1
20 21
21 20
22 15
23 1
24 35
25 1
26 30
27 1
28 55
29 1
30 154
31 1
32 1
33 140
34 105
35 264
36 385
37 1
38 210
39 420
40 693
41 1
42 780
43 1
44 1365
45 1001
46 420
47 1
48 1155
49 1
50 462
51 3080
52 3465
53 1
54 770
55 6552
56 6435
57 5460
58 1260
59 1
60 17017
61 1
62 2310
63 12155

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 5, 1, 6, 7, 1, 1, 10, 1, 21, 20, 15, 1, 35, 1, 30, 1, 55, 1, 154, 1, 1, 140, 105, 264, 385, 1, 210, 420, 693, 1, 780, 1, 1365, 1001, 420, 1, 1155, 1, 462, 3080, 3465, 1, 770, 6552, 6435, 5460, 1260, 1, 17017, 1, 2310, 12155]