login
T(n,k)=Number of nXk arrays of the minimum or maximum value of corresponding elements and their horizontal and vertical neighbors in a random 0..3 nXk array
3

%I #3 Dec 05 2012 05:38:57

%S 4,16,16,56,256,56,250,4020,4020,250,984,64862,252520,64862,984,3888,

%T 1029672,16187862,16187862,1029672,3888,15798,16468836,1028824446,

%U 4160361190,1028824446,16468836,15798,63092,262860066,65676456950

%N T(n,k)=Number of nXk arrays of the minimum or maximum value of corresponding elements and their horizontal and vertical neighbors in a random 0..3 nXk array

%C Table starts

%C .....4.......16.........56........250........984........3888.....15798.63092

%C ....16......256.......4020......64862....1029672....16468836.262860066

%C ....56.....4020.....252520...16187862.1028824446.65676456950

%C ...250....64862...16187862.4160361190

%C ...984..1029672.1028824446

%C ..3888.16468836

%C .15798

%e Some solutions for n=3 k=4

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

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

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

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_ Dec 05 2012