Number of maximal independent vertex sets (and minimal vertex covers) in the n-triangular honeycomb acute knight graph.
A290614
Number of maximal independent vertex sets (and minimal vertex covers) in the n-triangular honeycomb acute knight graph.
Terms
- a(0) =1a(1) =1a(2) =8a(3) =18a(4) =27a(5) =216a(6) =1764a(7) =10648a(8) =74088a(9) =1072148a(10) =21024576a(11) =348913664a(12) =7715561070a(13) =275259237625
External references
- oeis: A290614