A291873 Array read by antidiagonals: T(m,n) = number of connected dominating sets in the m X n king graph.
1, 3, 3, 4, 15, 4, 4, 48, 48, 4, 4, 144, 336, 144, 4, 4, 432, 2192, 2192, 432, 4, 4, 1296, 14544, 29648, 14544, 1296, 4, 4, 3888, 96528, 405648, 405648, 96528, 3888, 4, 4, 11664, 640336, 5568336, 11293568, 5568336, 640336, 11664, 4
Offset: 1
Examples
Array begins: ====================================================================== m\n| 1 2 3 4 5 6 7 ---|------------------------------------------------------------------ 1 | 1 3 4 4 4 4 4... 2 | 3 15 48 144 432 1296 3888... 3 | 4 48 336 2192 14544 96528 640336... 4 | 4 144 2192 29648 405648 5568336 76414224... 5 | 4 432 14544 405648 11293568 315156544 8793207424... 6 | 4 1296 96528 5568336 315156544 17784998912 1001953789632... 7 | 4 3888 640336 76414224 8793207424 1001953789632 113637188081536... ...
Links
- Andrew Howroyd, Table of n, a(n) for n = 1..435
- Eric Weisstein's World of Mathematics, Connected Dominating Set
- Eric Weisstein's World of Mathematics, King Graph