A208096 T(n,k)=Number of n X k nonnegative integer arrays with new values 0 upwards introduced in row major order and no element equal to any horizontal, diagonal or antidiagonal neighbor (colorings ignoring permutations of colors).
1, 1, 2, 2, 4, 5, 5, 30, 34, 15, 15, 377, 1573, 500, 52, 52, 7239, 169064, 192328, 10900, 203, 203, 193228, 34438557, 235862938, 43366459, 322768, 877, 877, 6752442, 11535531783, 677352910013, 746823293346, 15769674462, 12297768, 4140
Offset: 1
Examples
Table starts ....1........1...........2............5...........15..........52...........203 ....2........4..........30..........377.........7239......193228.......6752442 ....5.......34........1573.......169064.....34438557.11535531783.5804338800147 ...15......500......192328....235862938.677352910013 ...52....10900....43366459.746823293346 ..203...322768.15769674462 ..877.12297768 .4140 Some solutions for n=4 k=3 ..0..1..2....0..1..0....0..1..0....0..1..2....0..1..2....0..1..0....0..1..0 ..0..1..2....2..1..0....0..1..0....0..3..2....0..3..0....2..3..0....0..1..0 ..0..1..0....3..1..2....2..1..0....0..1..0....0..1..0....0..3..0....2..1..2 ..0..1..0....2..1..0....2..1..2....3..1..0....0..3..0....0..1..0....0..1..0
Links
- Andrew Howroyd, Table of n, a(n) for n = 1..210 (terms 1..39 from R. H. Hardin).