This site is supported by donations to The OEIS Foundation.



Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A220840 Number of 1-cop-win graphs of order n. 0
1, 1, 2, 5, 16, 68, 403, 3791, 65561, 2258313 (list; graph; refs; listen; history; text; internal format)



W. D. Baird, Cops and robbers on graphs and hypergraphs, MS Thesis, Applied Mathematics, Ryerson University, 2011. - From N. J. A. Sloane, Dec 29 2012

W. Baird, A. Beveridge, A. Bonato et al., On the minimum order of k-cop-win graphs, http://www.math.ryerson.ca/~abonato/mincop_0710_new.pdf, 2012.

W. Baird, A. Beveridge, A. Bonato, P. Codenotti, A. Maurer et al., On the minimum order of k-cop-win graphs, Ryerson Applied Mathematics Laboratory. Technical Report, Ryerson University, 2014; http://www.math.ryerson.ca/ramlab/publications/ramlab1404.pdf.


Table of n, a(n) for n=1..10.


Sequence in context: A122082 A002631 A107948 * A058673 A296675 A059295

Adjacent sequences:  A220837 A220838 A220839 * A220841 A220842 A220843




N. J. A. Sloane, Dec 23 2012



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 15 20:00 EST 2019. Contains 330000 sequences. (Running on oeis4.)