|
%I #7 Oct 04 2017 19:43:17
%S 1,3,24,624,58258,21423356,33352210384,234271975272172,
%T 7849205797114197704,1318509837007765330964948,
%U 1161589241831987552884873549832,5592410686612429649991093735982825800,152814054664056604403587836700924195641924920
%N Number of matchings in the n-triangular honeycomb bishop graph.
%C C# software that can be used to compute this sequence can be found in A270228 (with rook column heights of 1..n). - _Andrew Howroyd_, Oct 04 2017
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/IndependentEdgeSet.html">Independent Edge Set</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Matching.html">Matching</a>
%Y Cf. A270228.
%K nonn
%O 1,2
%A _Eric W. Weisstein_, Oct 03 2017
%E a(8)-a(13) from _Andrew Howroyd_, Oct 04 2017
| 