%I #6 Aug 12 2016 06:55:34
%S 1,1,0,1,0,1,1,0,0,2,1,0,1,1,9,1,0,4,16,86,44,1,0,10,133,3335,4701,
%T 265,1,0,25,1236,242563,2320408,378116,1854,1,0,45,15125,34126530,
%U 1900782587,2535597415,41728537,14833,1,0,120,214140,5123428157,1909319290122
%N T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, west, northwest or southwest neighbor modulo n and the upper left element equal to 0.
%C Table starts
%C ......1..........1.............1..............1.............1..........1
%C ......0..........0.............0..............0.............0..........0
%C ......1..........0.............1..............4............10.........25
%C ......2..........1............16............133..........1236......15125
%C ......9.........86..........3335.........242563......34126530.5123428157
%C .....44.......4701.......2320408.....1900782587.1909319290122
%C ....265.....378116....2535597415.26186341952354
%C ...1854...41728537.4417318594838
%C ..14833.5954780104
%C .133496
%H R. H. Hardin, <a href="/A266825/b266825.txt">Table of n, a(n) for n = 1..60</a>
%e Some solutions for n=4 k=4
%e ..0..3..2..1....0..2..1..1....0..2..1..3....0..3..3..1....0..0..3..1
%e ..0..3..2..1....3..2..1..0....0..2..1..3....0..3..2..1....0..3..2..1
%e ..0..3..2..1....2..1..0..3....0..2..1..3....0..2..2..1....0..3..2..1
%e ..0..3..2..1....2..0..3..3....0..2..1..3....3..2..1..0....3..2..2..1
%Y Column 1 is A000166(n-1).
%K nonn,tabl
%O 1,10
%A _R. H. Hardin_, Jan 04 2016
|