Number of minimum dominating sets in the n-triangular honeycomb bishop graph.
A381559
Number of minimum dominating sets in the n-triangular honeycomb bishop graph.
Terms
- a(0) =1a(1) =1a(2) =6a(3) =2a(4) =30a(5) =6a(6) =168a(7) =24a(8) =1080a(9) =120a(10) =7920a(11) =720a(12) =65520a(13) =5040a(14) =604800a(15) =40320a(16) =6168960a(17) =362880a(18) =68947200a(19) =3628800a(20) =838252800a(21) =39916800a(22) =11017036800a(23) =479001600a(24) =155675520000a(25) =6227020800a(27) =87178291200
External references
- oeis: A381559