Number of maximal matchings in the n-triangular honeycomb obtuse knight graph.

A375419

Number of maximal matchings in the n-triangular honeycomb obtuse knight graph.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =8a(4) =120a(5) =12623a(6) =1616850a(7) =399975427

External references