login
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 or antidiagonal neighbor (colorings ignoring permutations of colors).
13

%I #11 Mar 13 2023 13:31:13

%S 1,1,2,2,5,5,5,42,52,15,15,602,2906,877,52,52,12840,373780,433252,

%T 21147,203,203,373780,87852626,656404264,113503692,678570,877,877,

%U 14050312,33093356640,2227156082842,2475181138384,46538017584,27644437,4140

%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 or antidiagonal neighbor (colorings ignoring permutations of colors).

%H Andrew Howroyd, <a href="/A208301/b208301.txt">Table of n, a(n) for n = 1..210</a> (terms 1..58 from R. H. Hardin)

%e Table starts

%e ....1..........1.................2.....................5

%e ....2..........5................42...................602

%e ....5.........52..............2906................373780

%e ...15........877............433252.............656404264

%e ...52......21147.........113503692.........2475181138384

%e ..203.....678570.......46538017584.....17131843186425504

%e ..877...27644437....27700815674032.196551307092757144384

%e .4140.1382958545.22702140562948192

%e Some solutions for n=4 k=3

%e ..0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..2....0..1..0

%e ..0..1..0....0..1..0....0..1..0....0..1..0....2..3..0....0..3..0....0..1..0

%e ..0..1..0....0..2..1....0..1..0....0..1..0....0..2..0....0..1..0....2..1..0

%e ..0..2..1....0..2..0....0..1..0....0..1..2....0..1..0....0..3..0....2..1..2

%Y Columns 1..6 are A000110, A099977(n-1), A208297, A208298, A208299, A208300

%Y Rows 1..7 are A000110(n-1), A208302, A208303, A208305, A208305, A208306, A208307.

%Y Main diagonal is A361450.

%Y Cf. A207868.

%K nonn,tabl

%O 1,3

%A _R. H. Hardin_, Feb 25 2012