A231753 T(n,k)=Number of nXk 0..2 arrays with no element less than a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors.
3, 3, 3, 9, 15, 9, 22, 51, 51, 22, 51, 186, 589, 186, 51, 121, 687, 5106, 5106, 687, 121, 292, 2485, 41288, 101517, 41288, 2485, 292, 704, 9068, 397219, 1787168, 1787168, 397219, 9068, 704, 1691, 33308, 3745096, 36596191, 67411714, 36596191, 3745096
Offset: 1
Examples
Some solutions for n=4 k=4 ..1..0..1..1....1..0..0..0....2..0..0..2....2..2..0..0....0..0..2..2 ..0..0..0..2....0..0..0..1....1..0..0..0....1..0..0..0....0..1..0..0 ..0..0..1..0....1..0..0..1....2..0..0..0....0..1..0..0....2..0..0..0 ..1..0..0..0....1..0..0..0....2..1..0..0....0..0..0..1....2..0..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..112
Crossrefs
Column 1 is A202882 for n>1
Formula
Empirical for column k:
k=1: a(n) = 3*a(n-1) -3*a(n-2) +4*a(n-3) -a(n-4) +a(n-5) for n>6
k=2: [order 11]
k=3: [order 40] for n>41
Comments