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.

A341847 Array read by antidiagonals: T(n,m) is the number of maximal 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 10
18 10
19 3
20 1
21 1
22 15
23 40
24 84
25 40
26 15
27 1
28 1
29 15
30 296
31 852
32 852
33 296
34 15
35 1
36 1
37 105
38 1576
39 11580
40 22368
41 11580
42 1576
43 105
44 1
45 1
46 105
47 15352
48 197640
49 822528
50 822528
51 197640
52 15352
53 105
54 1
55 1
56 945
57 104000
58 4314240
59 38772864
60 84961440
61 38772864
62 4314240
63 104000
64 945
65 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 3, 1, 1, 3, 10, 10, 3, 1, 1, 15, 40, 84, 40, 15, 1, 1, 15, 296, 852, 852, 296, 15, 1, 1, 105, 1576, 11580, 22368, 11580, 1576, 105, 1, 1, 105, 15352, 197640, 822528, 822528, 197640, 15352, 105, 1, 1, 945, 104000, 4314240, 38772864, 84961440, 38772864, 4314240, 104000, 945, 1]