A183554 T(n,k)=Number of nXk 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.
0, 3, 3, 3, 15, 3, 9, 71, 71, 9, 15, 299, 583, 299, 15, 33, 1325, 5287, 5287, 1325, 33, 63, 5845, 46841, 95101, 46841, 5845, 63, 129, 25785, 417809, 1728533, 1728533, 417809, 25785, 129, 255, 113841, 3721925, 31363527, 63868351, 31363527, 3721925, 113841
Offset: 1
Examples
Some solutions for 4X3 ..0..0..1....0..0..1....0..0..0....0..0..1....1..0..0....1..1..0....1..1..1 ..2..0..1....0..2..1....2..2..0....2..2..1....1..1..0....0..0..0....1..2..1 ..2..0..0....2..2..2....2..1..2....2..1..1....0..1..0....0..0..1....1..2..1 ..2..2..2....0..0..0....2..1..2....2..2..1....0..1..1....2..2..1....1..2..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..127
Crossrefs
Column 1 is A062510(n-1)
Comments