A287228 Number of matchings in the n-triangular honeycomb obtuse knight graph.
1, 1, 1, 27, 2376, 298062, 66426798, 47833036802, 119487298588717, 857547047985463278
Offset: 1
Links
- Stan Wagon, Graph Theory Problems from Hexagonal and Traditional Chess, The College Mathematics Journal, Vol. 45, No. 4, September 2014, pp. 278-287.
- Eric Weisstein's World of Mathematics, Independent Edge Set
- Eric Weisstein's World of Mathematics, Matching
Extensions
a(9)-a(10) from Andrew Howroyd, Jul 17 2017