The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #10 Oct 15 2020 03:14:49
%S 1,1,2,5,16,68,403,3791,65561,2258313
%N Number of 1-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://web.archive.org/web/20121114195010/http://www.math.ryerson.ca/~abonato/mincop_0710_new.pdf">On the minimum order of k-cop-win graphs</a>, 2012.
%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,3
%A _N. J. A. Sloane_, Dec 23 2012