A203542 T(n,k)=Number of nXk 0..2 arrays with every element neighboring horizontally or vertically both a 0 and a 1.
0, 0, 0, 0, 4, 0, 0, 4, 4, 0, 0, 16, 72, 16, 0, 0, 64, 144, 144, 64, 0, 0, 196, 1840, 3364, 1840, 196, 0, 0, 676, 10404, 30976, 30976, 10404, 676, 0, 0, 2304, 69920, 614656, 1700580, 614656, 69920, 2304, 0, 0, 7744, 490000, 8479744, 46485124, 46485124, 8479744
Offset: 1
Examples
Some solutions for n=5 k=3 ..0..1..0....1..0..2....2..0..0....0..1..0....1..1..2....1..1..1....1..0..1 ..0..1..0....1..0..1....1..1..1....0..1..0....0..0..0....0..0..0....1..0..1 ..1..2..0....1..0..1....0..0..1....2..2..1....1..2..1....1..2..2....1..1..2 ..1..2..1....0..0..0....0..2..0....1..0..1....1..0..1....1..0..1....0..1..0 ..0..0..1....2..1..1....1..1..0....1..0..1....2..0..1....2..0..1....0..1..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..161
Comments