login
A288026
Array read by antidiagonals: T(m,n) = number of maximal matchings in the grid graph P_m X P_n.
4
1, 1, 1, 2, 2, 2, 2, 5, 5, 2, 3, 11, 22, 11, 3, 4, 24, 75, 75, 24, 4, 5, 51, 264, 400, 264, 51, 5, 7, 109, 941, 2357, 2357, 941, 109, 7, 9, 234, 3286, 13407, 22228, 13407, 3286, 234, 9, 12, 503, 11623, 76667, 207423, 207423, 76667, 11623, 503, 12
OFFSET
1,4
LINKS
Eric Weisstein's World of Mathematics, Grid Graph
Eric Weisstein's World of Mathematics, Maximal Independent Edge Set
EXAMPLE
Table starts:
=====================================================
m\n| 1 2 3 4 5 6 7
---|-------------------------------------------------
1 | 1 1 2 2 3 4 5 ...
2 | 1 2 5 11 24 51 109 ...
3 | 2 5 22 75 264 941 3286 ...
4 | 2 11 75 400 2357 13407 76667 ...
5 | 3 24 264 2357 22228 207423 1922112 ...
6 | 4 51 941 13407 207423 3136370 47256485 ...
7 | 5 109 3286 76667 1922112 47256485 1158560776 ...
...
CROSSREFS
Main diagonal is A287595.
Rows 1-3 are A182097(n+2), A286945, A288028.
Sequence in context: A333505 A177333 A118486 * A141299 A035681 A195601
KEYWORD
nonn,tabl
AUTHOR
Andrew Howroyd, Jun 04 2017
STATUS
approved