A231651 T(n,k)=Number of nXk 0..2 arrays with no element less than a strict majority of its horizontal and vertical neighbors.
3, 3, 3, 9, 35, 9, 22, 104, 104, 22, 51, 341, 920, 341, 51, 121, 1189, 7682, 7682, 1189, 121, 292, 4040, 61574, 137961, 61574, 4040, 292, 704, 13560, 490760, 2412274, 2412274, 490760, 13560, 704, 1691, 45803, 3929027, 42882766, 96014413, 42882766
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..0..0..0....0..0..0..0....0..0..2..2....2..1..1..2....2..2..0..0 ..1..1..1..1....0..0..2..2....0..0..0..1....2..1..1..2....2..0..0..0 ..1..1..2..2....2..0..0..0....0..2..0..0....1..1..1..2....0..0..1..0
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 11] for n>12
k=3: [order 36] for n>37
Comments