[go: up one dir, main page]

login
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal or vertical neighbors.
6

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

%S 1,0,2,0,2,6,0,2,12,24,0,2,36,504,120,0,2,114,10728,22320,720,0,2,420,

%T 269352,4857120,1521360,5040,0,2,1584,7340712,1286876160,4099655520,

%U 140394240,40320,0,2,6228,212706840,378296480400,13998666435840

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

%C Table starts

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

%C .......2.............2.................2..................2.................2

%C .......6............12................36................114...............420

%C ......24...........504.............10728.............269352...........7340712

%C .....120.........22320...........4857120.........1286876160......378296480400

%C .....720.......1521360........4099655520.....13998666435840.54517360458428640

%C ....5040.....140394240.....5589688315680.292785244605453600

%C ...40320...17034433920.11532215497783680

%C ..362880.2627788262400

%C .3628800

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

%e Some solutions for n=3 k=4

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

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

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

%Y Column 1 is A000142.

%K nonn,tabl

%O 1,3

%A _R. H. Hardin_, Nov 29 2015