A251532 Independence number of the n-triangular honeycomb obtuse knight graph.

1, 3, 6, 7, 7, 9, 15, 18, 21, 21, 27, 31, 36, 42, 42, 47, 54, 62, 70, 70, 77, 85, 95, 105, 109, 117, 126, 136, 147, 155, 166, 176, 187, 199, 210, 222, 235, 247, 260, 274, 287, 301, 316, 330, 345, 361, 376, 392, 409, 425, 442, 460, 477, 495, 514, 532, 551, 571

Offset: 1

Author

N. J. A. Sloane, Dec 04 2014

Keywords

• nonn

Links

• Andy Huchala, Table of n, a(n) for n = 1..255
• Andy Huchala, Python program.
• 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, Independence Number.

Extensions

a(20)-a(24) from Eric W. Weisstein, May 21-25 2017

a(25)-a(58) from Andy Huchala, Mar 31 2024