A222587 T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..2 order.
1, 1, 1, 1, 1, 1, 4, 5, 5, 4, 5, 18, 9, 18, 5, 14, 59, 112, 112, 59, 14, 17, 200, 426, 1087, 426, 200, 17, 70, 820, 4790, 11442, 11442, 4790, 820, 70, 89, 3014, 18007, 128213, 111951, 128213, 18007, 3014, 89, 326, 11364, 208768, 1471412, 3778560, 3778560, 1471412
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..0..1..2....0..1..1..1....0..1..1..1....0..1..1..1....0..1..0..0 ..0..0..0..1....1..1..1..1....1..1..1..1....0..1..1..1....2..0..0..0 ..0..0..0..0....1..1..1..1....0..1..1..1....2..1..1..1....0..0..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..111
Comments