cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A293249 Number of matchings in the n-triangular honeycomb bishop graph.

This page as a plain text file.
%I A293249 #8 Feb 16 2025 08:33:51
%S A293249 1,3,24,624,58258,21423356,33352210384,234271975272172,
%T A293249 7849205797114197704,1318509837007765330964948,
%U A293249 1161589241831987552884873549832,5592410686612429649991093735982825800,152814054664056604403587836700924195641924920
%N A293249 Number of matchings in the n-triangular honeycomb bishop graph.
%C A293249 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 A293249 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IndependentEdgeSet.html">Independent Edge Set</a>
%H A293249 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Matching.html">Matching</a>
%Y A293249 Cf. A270228.
%K A293249 nonn
%O A293249 1,2
%A A293249 _Eric W. Weisstein_, Oct 03 2017
%E A293249 a(8)-a(13) from _Andrew Howroyd_, Oct 04 2017