A231663 T(n,k)=Number of nXk 0..2 arrays with no element less than a strict majority of its horizontal, vertical and antidiagonal neighbors.
3, 3, 3, 9, 15, 9, 22, 93, 93, 22, 51, 458, 1197, 458, 51, 121, 2163, 13434, 13434, 2163, 121, 292, 10789, 144465, 345519, 144465, 10789, 292, 704, 53813, 1607589, 8300390, 8300390, 1607589, 53813, 704, 1691, 265397, 17962078, 206363144, 434469343
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..0..0..2....2..1..0..0....0..0..1..1....0..0..1..0....1..1..0..2 ..0..2..0..0....1..1..0..0....0..0..1..0....0..0..0..0....1..0..0..1 ..2..2..0..2....2..2..0..2....1..0..0..0....0..0..1..0....2..0..1..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..161
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 15]
k=3: [order 57]
Comments