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.

A355572 Largest LCM of partitions of n into odd parts.

Table of values

n a(n)
1 1
2 1
3 3
4 3
5 5
6 5
7 7
8 15
9 15
10 21
11 21
12 35
13 35
14 45
15 105
16 105
17 105
18 105
19 165
20 165
21 315
22 315
23 385
24 385
25 495
26 1155
27 1155
28 1365
29 1365
30 1365
31 1365
32 3465
33 3465
34 4095
35 4095
36 5005
37 5005
38 6435
39 15015
40 15015
41 15015
42 15015
43 19635
44 19635
45 45045
46 45045
47 45045
48 45045
49 58905
50 58905
51 69615
52 69615

List of values

[1, 1, 3, 3, 5, 5, 7, 15, 15, 21, 21, 35, 35, 45, 105, 105, 105, 105, 165, 165, 315, 315, 385, 385, 495, 1155, 1155, 1365, 1365, 1365, 1365, 3465, 3465, 4095, 4095, 5005, 5005, 6435, 15015, 15015, 15015, 15015, 19635, 19635, 45045, 45045, 45045, 45045, 58905, 58905, 69615, 69615]