A286849 Array read by antidiagonals: T(m,n) = number of minimal dominating sets in the n X m king graph.
1, 2, 2, 2, 4, 2, 4, 6, 6, 4, 4, 16, 12, 16, 4, 7, 20, 36, 36, 20, 7, 9, 52, 64, 256, 64, 52, 9, 13, 80, 204, 400, 400, 204, 80, 13, 18, 176, 446, 2704, 971, 2704, 446, 176, 18, 25, 296, 1184, 6400, 6486, 6486, 6400, 1184, 296, 25
Offset: 1
Examples
Array begins: =========================================================== m\n| 1 2 3 4 5 6 7 8 ---|------------------------------------------------------- 1 | 1 2 2 4 4 7 9 13... 2 | 2 4 6 16 20 52 80 176... 3 | 2 6 12 36 64 204 446 1184... 4 | 4 16 36 256 400 2704 6400 30976... 5 | 4 20 64 400 971 6486 22177 112317... 6 | 7 52 204 2704 6486 85405 351503 3082745... 7 | 9 80 446 6400 22177 351503 1997448 21587536... 8 | 13 176 1184 30976 112317 3082745 21587536 360584008... ...
Links
- Andrew Howroyd, Table of n, a(n) for n = 1..153
- Eric Weisstein's World of Mathematics, King Graph
- Eric Weisstein's World of Mathematics, Minimal Dominating Set