Number of maximal independent vertex sets (and minimal vertex covers) in the n X n knight graph.
A289201
Number of maximal independent vertex sets (and minimal vertex covers) in the n X n knight graph.
Terms
- a(0) =1a(1) =1a(2) =10a(3) =31a(4) =172a(5) =2253a(6) =50652a(7) =900243a(8) =26990541a(9) =1534414257
External references
- oeis: A289201