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.

A368116 A(m, n) = lcm_{p in Partitions(n)} (Product_{r in p}(r + m)). Array read by ascending antidiagonals, for m, n >= 0.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 2
6 1
7 3
8 12
9 6
10 1
11 4
12 36
13 24
14 12
15 1
16 5
17 80
18 540
19 720
20 60
21 1
22 6
23 150
24 960
25 6480
26 1440
27 360
28 1
29 7
30 252
31 5250
32 134400
33 136080
34 60480
35 2520
36 1
37 8
38 392
39 1512
40 315000
41 537600
42 8164800
43 120960
44 5040
45 1
46 9
47 576
48 24696
49 63504
50 1575000
51 32256000
52 24494400
53 3628800
54 15120

List of values

[1, 1, 1, 1, 2, 2, 1, 3, 12, 6, 1, 4, 36, 24, 12, 1, 5, 80, 540, 720, 60, 1, 6, 150, 960, 6480, 1440, 360, 1, 7, 252, 5250, 134400, 136080, 60480, 2520, 1, 8, 392, 1512, 315000, 537600, 8164800, 120960, 5040, 1, 9, 576, 24696, 63504, 1575000, 32256000, 24494400, 3628800, 15120]