login
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, southwest or northwest neighbor modulo n and the upper left element equal to 0.
5

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

%S 1,1,0,1,0,1,1,0,1,2,1,0,2,7,9,1,0,5,76,351,44,1,0,11,943,33529,19773,

%T 265,1,0,26,12549,4555903,22720474,1567330,1854,1,0,46,205452,

%U 763867475,36358021513,25455579224,166758092,14833,1,0,121,3751651,138332628493

%N T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, southwest or northwest neighbor modulo n and the upper left element equal to 0.

%C Table starts

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

%C .....0.........0...........0...........0.........0............0.......0...0.0

%C .....1.........1...........2...........5........11...........26......46.121

%C .....2.........7..........76.........943.....12549.......205452.3751651

%C .....9.......351.......33529.....4555903.763867475.138332628493

%C ....44.....19773....22720474.36358021513

%C ...265...1567330.25455579224

%C ..1854.166758092

%C .14833

%e Some solutions for n=4 k=4

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

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

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

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

%Y Column 1 is A000166(n-1).

%K nonn,tabl

%O 1,10

%A _R. H. Hardin_, Jan 05 2016