A232281 T(n,k)=Number of nXk 0..2 arrays with no element less than a strict majority of its horizontal, diagonal and antidiagonal neighbors.
3, 3, 9, 9, 35, 27, 22, 199, 104, 81, 51, 1066, 1672, 341, 243, 121, 6019, 23055, 18117, 1189, 729, 292, 32301, 293426, 604133, 184115, 4040, 2187, 704, 174400, 3476318, 17145989, 14477600, 1774344, 13560, 6561, 1691, 944500, 43029161, 450287974
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..0..0..1....2..0..0..0....0..2..0..0....2..2..1..1....0..1..0..2 ..1..0..1..2....2..0..0..0....0..0..0..0....1..1..2..2....2..0..0..0 ..0..0..0..0....0..2..1..2....0..0..0..0....1..1..1..1....0..2..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..127
Formula
Empirical for column k:
k=1: a(n) = 3*a(n-1)
k=2: [order 11] for n>12
k=3: [order 35] for n>36
Empirical for row n:
n=1: a(n) = 3*a(n-1) -3*a(n-2) +4*a(n-3) -a(n-4) +a(n-5) for n>6
n=2: [order 10]
n=3: [order 52] for n>53
Comments