Number of maximal irredundant sets in the n-triangular honeycomb obtuse knight graph.
A347997
Number of maximal irredundant sets in the n-triangular honeycomb obtuse knight graph.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =8a(4) =396a(5) =2895a(6) =19861
External references
- oeis: A347997