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.

A341850 Array read by antidiagonals: T(n,m) is the number of maximum matchings in the rook graph K_n X K_m.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 3
12 2
13 3
14 1
15 1
16 3
17 4
18 4
19 3
20 1
21 1
22 15
23 16
24 72
25 16
26 15
27 1
28 1
29 15
30 56
31 132
32 132
33 56
34 15
35 1
36 1
37 105
38 376
39 7020
40 2016
41 7020
42 376
43 105
44 1
45 1
46 105
47 1912
48 17280
49 44928
50 44928
51 17280
52 1912
53 105
54 1
55 1
56 945
57 17984
58 1920240
59 1551744
60 22615200
61 1551744
62 1920240
63 17984
64 945
65 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 3, 1, 1, 3, 4, 4, 3, 1, 1, 15, 16, 72, 16, 15, 1, 1, 15, 56, 132, 132, 56, 15, 1, 1, 105, 376, 7020, 2016, 7020, 376, 105, 1, 1, 105, 1912, 17280, 44928, 44928, 17280, 1912, 105, 1, 1, 945, 17984, 1920240, 1551744, 22615200, 1551744, 1920240, 17984, 945, 1]