login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A289201 Number of maximal independent vertex sets (and minimal vertex covers) in the n X n knight graph. 0
1, 1, 10, 31, 172, 2253, 50652, 900243, 26990541, 1534414257 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

Eric Weisstein's World of Mathematics, Knight Graph

Eric Weisstein's World of Mathematics, Maximal Independent Vertex Set

Eric Weisstein's World of Mathematics, Minimal Vertex Cover

MATHEMATICA

Table[Length[FindIndependentVertexSet[KnightTourGraph[n, n], Infinity, All]], {n, 7}]

CROSSREFS

Cf. A141243, A289203, A287071, A289200.

Sequence in context: A161325 A187705 A267564 * A042849 A097236 A332254

Adjacent sequences:  A289198 A289199 A289200 * A289202 A289203 A289204

KEYWORD

nonn,more

AUTHOR

Eric W. Weisstein, Jun 28 2017

EXTENSIONS

a(9)-a(10) from Andrew Howroyd, Jul 01 2017

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 September 26 23:44 EDT 2022. Contains 357051 sequences. (Running on oeis4.)