|
%I #45 Apr 14 2024 18:03:39
%S 1,3,6,7,7,9,15,18,21,21,27,31,36,42,42,47,54,62,70,70,77,85,95,105,
%T 109,117,126,136,147,155,166,176,187,199,210,222,235,247,260,274,287,
%U 301,316,330,345,361,376,392,409,425,442,460,477,495,514,532,551,571
%N Independence number of the n-triangular honeycomb obtuse knight graph.
%H Andy Huchala, <a href="/A251532/b251532.txt">Table of n, a(n) for n = 1..255</a>
%H Andy Huchala, <a href="/A251532/a251532.py.txt">Python program</a>.
%H Stan Wagon, <a href="http://www.jstor.org/stable/10.4169/college.math.j.45.4.278">Graph Theory Problems from Hexagonal and Traditional Chess</a>, The College Mathematics Journal, Vol. 45, No. 4, September 2014, pp. 278-287.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/IndependenceNumber.html">Independence Number</a>.
%K nonn,more,changed
%O 1,2
%A _N. J. A. Sloane_, Dec 04 2014
%E a(20)-a(24) from _Eric W. Weisstein_, May 21-25 2017
%E a(25)-a(58) from _Andy Huchala_, Mar 31 2024
|
