%I #20 Jul 30 2020 22:03:42
%S 0,0,0,1,5,44,450,7326,195519,9458257
%N Number of 2-cop-win graphs of order n.
%H W. D. Baird, <a href="https://digital.library.ryerson.ca/islandora/object/RULA:1360">Cops and robbers on graphs and hypergraphs</a>, MS Thesis, Applied Mathematics, Ryerson University, 2011. - From _N. J. A. Sloane_, Dec 29 2012
%H W. Baird, A. Beveridge, A. Bonato et al., <a href="https://arxiv.org/abs/1308.2841">On the minimum order of k-cop-win graphs</a>, arXiv:1308.2841 [math.CO], 2013.
%H W. Baird, A. Beveridge, A. Bonato, P. Codenotti, A. Maurer et al., <a href="http://www.math.ryerson.ca/ramlab/publications/ramlab1404.pdf">On the minimum order of k-cop-win graphs</a>, Ryerson Applied Mathematics Laboratory. Technical Report, Ryerson University, 2014.
%K nonn,more
%O 1,5
%A _N. J. A. Sloane_, Dec 23 2012