login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(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
)
OFFSET
1,3
LINKS
Table of n, a(n) for n=1..10.
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
, 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.
CROSSREFS
Sequence in context:
A122082
A002631
A107948
*
A058673
A296675
A059295
Adjacent sequences:
A220837
A220838
A220839
*
A220841
A220842
A220843
KEYWORD
nonn
,
more
AUTHOR
N. J. A. Sloane
, Dec 23 2012
STATUS
approved
Lookup
|
Welcome
|
Wiki
|
Register
|
Music
|
Plot 2
|
Demos
|
Index
|
Browse
|
More
|
WebCam
Contribute new seq. or comment
|
Format
|
Style Sheet
|
Transforms
|
Superseeker
|
Recents
The OEIS Community
| Maintained by
The OEIS Foundation Inc.
License Agreements, Terms of Use, Privacy Policy.
.
Last modified August 24 10:52 EDT 2024. Contains 375410 sequences. (Running on oeis4.)