A287230 Number of matchings in the n-triangular honeycomb acute knight graph.
1, 1, 8, 64, 1331, 64000, 6400075, 1404928000, 677298787768, 712186032947200, 1635557819719974912, 8209592592625295700893, 90036881979773511965369428, 2157454308508779392217680572439, 112955975573487831948842897960075264, 12921763288870998051759383983484279183072, 3229803978189426975602886931834056243712000000
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(11) from Eric W. Weisstein, Jun 25 2017
a(12)-a(14) from Andrew Howroyd, Jul 17 2017
a(15)-a(17) from Eric W. Weisstein, Sep 02 2025