A219741 T(n,k) = Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal, vertical or antidiagonal neighbor in a random 0..1 nXk array.
1, 2, 2, 4, 6, 4, 7, 13, 13, 7, 12, 28, 42, 28, 12, 21, 60, 126, 126, 60, 21, 37, 129, 387, 524, 387, 129, 37, 65, 277, 1180, 2229, 2229, 1180, 277, 65, 114, 595, 3606, 9425, 13322, 9425, 3606, 595, 114, 200, 1278, 11012, 39905, 78661, 78661, 39905, 11012, 1278, 200
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..0..0..0....1..0..0..1....0..0..1..0....0..0..1..0....0..0..0..1 ..0..1..0..0....0..0..0..0....1..0..0..0....0..0..0..0....0..1..0..0 ..0..0..0..0....0..1..0..1....0..0..0..1....1..0..0..1....0..0..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..337
Crossrefs
Formula
Zeilberger's Maple code (see links in A228285) would presumably give recurrences for the columns of this array. - N. J. A. Sloane, Aug 22 2013
Comments