A367928 Lower matching number of the n-triangular honeycomb obtuse knight graph.

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, 117, 126, 135, 145, 155, 165, 176, 187, 198, 210, 222, 234, 247, 260, 273, 287, 301, 315, 330, 354, 360, 376, 392, 408, 425, 442

Offset

1,4

Links

Table of n, a(n) for n=1..51.

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, Lower Matching Number.

Eric Weisstein's World of Mathematics, Triangular Honeycomb Obtuse Knight Graph.

Crossrefs

Sequence in context: A064002 A195868 A228543 * A254764 A109535 A361327

Adjacent sequences: A367925 A367926 A367927 * A367929 A367930 A367931

Keyword

nonn,more,hard

Author

Eric W. Weisstein, Dec 05 2023

Extensions

a(15) and beyond from Eric W. Weisstein, Dec 07-08 2024

Status

approved