%I #36 Dec 14 2024 07:17:43
%S 0,0,0,3,5,7,7,9,14,18,20,24,28,33,39,45,50,55,62,70,77,84,91,99,108,
%T 117,126,135,145,155,165,176,187,198,210,222,234,247,260,273,287,301,
%U 315,330,354,360,376,392,408,425,442
%N Lower matching number of the n-triangular honeycomb obtuse knight graph.
%H Stan Wagon, <a href="http://www.jstor.org/stable/10.4169/college.math.j.45.4.278">Graph Theory Problems from Hexagonal and Traditional Chess</a>, The College Mathematics Journal, Vol. 45, No. 4, September 2014, pp. 278-287.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/LowerMatchingNumber.html">Lower Matching Number</a>.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TriangularHoneycombObstueKnightGraph.html">Triangular Honeycomb Obtuse Knight Graph</a>.
%K nonn,more,hard
%O 1,4
%A _Eric W. Weisstein_, Dec 05 2023
%E a(15) and beyond from _Eric W. Weisstein_, Dec 07-08 2024