|
%I #13 Jun 26 2017 01:25:38
%S 1,1,1,2,1,2,5,7,7,5,15,87,270,87,15,52,1657,27093,27093,1657,52,203,
%T 43833,5252041,30066912,5252041,43833,203,877,1515903,1688298227,
%U 80318704605,80318704605,1688298227,1515903,877,4140,65766991
%N 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, vertical, diagonal or antidiagonal neighbor (colorings ignoring permutations of colors).
%C Equivalently, the number of colorings of the n x k king graph using any number of colors up to permutation of the colors. - _Andrew Howroyd_, Jun 25 2017
%H Andrew Howroyd, <a href="/A208021/b208021.txt">Table of n, a(n) for n = 1..231</a> (terms 1..49 from R. H. Hardin)
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/KingGraph.html">King Graph</a>
%e Table starts
%e ...1........1............2...............5...............15..............52
%e ...1........1............7..............87.............1657...........43833
%e ...2........7..........270...........27093..........5252041......1688298227
%e ...5.......87........27093........30066912......80318704605.421673189900658
%e ..15.....1657......5252041.....80318704605.3662498214110836
%e ..52....43833...1688298227.421673189900658
%e .203..1515903.819147302097
%e .877.65766991
%e ...
%e Some solutions for n=4 k=3
%e ..0..1..2....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..2
%e ..2..3..4....2..3..2....2..3..2....2..3..2....2..3..2....2..3..2....2..3..0
%e ..5..6..0....4..0..4....0..1..0....4..1..0....0..1..0....0..4..0....4..5..4
%e ..2..3..1....1..2..1....2..3..4....5..2..3....2..4..2....1..2..1....0..1..2
%Y Columns 1-5 are A000110(n-1), A020556(n-1), A208018, A208019, A208020.
%Y Main diagonal is A289136.
%Y Cf. A207868, A212208, A212209.
%K nonn,tabl
%O 1,4
%A _R. H. Hardin_, Feb 22 2012
| 