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.
%I A341847 #12 Feb 16 2025 08:34:01 %S A341847 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, %T A341847 296,852,852,296,15,1,1,105,1576,11580,22368,11580,1576,105,1,1,105, %U A341847 15352,197640,822528,822528,197640,15352,105,1,1,945,104000,4314240,38772864,84961440,38772864,4314240,104000,945,1 %N A341847 Array read by antidiagonals: T(n,m) is the number of maximal matchings in the rook graph K_n X K_m. %H A341847 Andrew Howroyd, <a href="/A341847/b341847.txt">Table of n, a(n) for n = 0..275</a> %H A341847 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentEdgeSet.html">Maximal Independent Edge Set</a> %H A341847 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/RookGraph.html">Rook Graph</a> %F A341847 T(n,m) = T(m,n). %e A341847 Array begins: %e A341847 ============================================================= %e A341847 n\m | 0 1 2 3 4 5 6 %e A341847 ----+-------------------------------------------------------- %e A341847 0 | 1 1 1 1 1 1 1 ... %e A341847 1 | 1 1 1 3 3 15 15 ... %e A341847 2 | 1 1 2 10 40 296 1576 ... %e A341847 3 | 1 3 10 84 852 11580 197640 ... %e A341847 4 | 1 3 40 852 22368 822528 38772864 ... %e A341847 5 | 1 15 296 11580 822528 84961440 12002446080 ... %e A341847 6 | 1 15 1576 197640 38772864 12002446080 5429866337280 ... %e A341847 ... %Y A341847 Rows n=1..4 are A133221(n+1), A281433, A341848, A341849. %Y A341847 Main diagonal is A289198. %Y A341847 Cf. A270227 (matchings), A297471, A341850 (maximum matchings). %K A341847 nonn,tabl %O A341847 0,12 %A A341847 _Andrew Howroyd_, Feb 21 2021