|
%I #8 Mar 24 2023 09:54:42
%S 1,1,0,1,0,1,1,0,4,2,1,0,17,39,9,1,0,66,999,1281,44,1,0,324,31501,
%T 328701,67240,265,1,0,1565,1115170,104767812,200359723,5126572,1854,1,
%U 0,7908,41983402,37478933496,781538349425,215846101578,531096757,14833,1,0
%N T(n,k) = Number of n X k arrays containing k copies of 0..n-1 with no element 1 greater than its north 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.......4...........17................66..............324...........1565
%C ...2......39..........999.............31501..........1115170.......41983402
%C ...9....1281.......328701.........104767812......37478933496.14445711101455
%C ..44...67240....200359723......781538349425.3543965467781564
%C .265.5126572.215846101578.12529121512138533
%H R. H. Hardin, <a href="/A266861/b266861.txt">Table of n, a(n) for n = 1..60</a>
%e Some solutions for n=4, k=4
%e ..0..0..2..3....0..1..3..1....0..2..0..3....0..3..0..1....0..2..0..2
%e ..2..3..1..1....3..1..1..3....2..0..3..1....0..2..3..3....0..1..2..0
%e ..1..2..3..1....2..3..0..2....2..0..2..3....0..1..1..2....3..3..1..3
%e ..0..0..2..3....0..2..0..2....1..3..1..1....2..1..3..2....3..1..1..2
%Y Column 1 is A000166(n-1).
%K nonn,tabl
%O 1,9
%A _R. H. Hardin_, Jan 04 2016
|
