A208434 T(n,k)=Number of nXk 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).
1, 2, 2, 5, 14, 5, 14, 54, 54, 14, 41, 216, 129, 216, 41, 122, 864, 339, 339, 864, 122, 365, 3456, 1123, 1292, 1123, 3456, 365, 1094, 13824, 4155, 6416, 6416, 4155, 13824, 1094, 3281, 55296, 15273, 32813, 50507, 32813, 15273, 55296, 3281, 9842, 221184, 55715
Offset: 1
Examples
Some solutions for n=4 k=3 ..0..0..0....0..1..0....0..1..0....0..0..0....0..1..2....0..0..1....0..0..0 ..1..0..2....1..1..1....2..1..2....1..1..1....1..2..1....2..0..1....1..1..2 ..1..1..2....2..1..2....0..1..0....2..1..2....0..1..0....2..2..1....1..2..2 ..1..0..2....0..2..0....2..1..2....0..2..0....1..0..1....2..0..1....0..0..2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..220
Crossrefs
Column 1 is A007051(n-1)
Comments