login
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal or vertical neighbors and new values introduced sequentially from 0.
5

%I #6 Aug 12 2016 06:55:34

%S 1,0,1,0,1,1,0,1,2,1,0,1,6,21,1,0,1,19,447,186,1,0,1,70,11223,40476,

%T 2113,1,0,1,264,305863,10723968,5693966,27856,1,0,1,1038,8862785,

%U 3152470670,19442592272,1109065142,422481,1,0,1,4155,267827143,995141926013

%N T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal or vertical neighbors and new values introduced sequentially from 0.

%C Table starts

%C .1.......0............0..............0..............0............0

%C .1.......1............1..............1..............1............1

%C .1.......2............6.............19.............70..........264

%C .1......21..........447..........11223.........305863......8862785

%C .1.....186........40476.......10723968.....3152470670.995141926013

%C .1....2113......5693966....19442592272.75718556192262

%C .1...27856...1109065142.58092310437590

%C .1..422481.286017249449

%C .1.7241480

%C .1

%H R. H. Hardin, <a href="/A265170/b265170.txt">Table of n, a(n) for n = 1..60</a>

%e Some solutions for n=4 k=4

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

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

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

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

%Y Row 3 is A199128.

%Y Row 4 is A199252.

%K nonn,tabl

%O 1,9

%A _R. H. Hardin_, Dec 03 2015