|
%I #12 Aug 05 2016 11:09:04
%S 1,3,6,7,7,9,15,18,21,21,27,31,37,42,44,49,56,63,70
%N Clique covering number of obtuse knights graph N_n.
%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
%K nonn,more
%O 1,2
%A _N. J. A. Sloane_, Dec 04 2014
|
