|
%I #3 Nov 17 2015 18:05:19
%S 1,1,1,2,3,1,4,24,15,2,12,316,888,156,4,36,6080,84672,58368,2032,8,
%T 144,149824,17444160,66194496,7019136,30912,24,576,5728896,5356808640
%N T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 3.
%C Table starts
%C ..1.....1.......2........4.......12.........36.....144.576
%C ..1.....3......24......316.....6080.....149824.5728896
%C ..1....15.....888....84672.17444160.5356808640
%C ..2...156...58368.66194496
%C ..4..2032.7019136
%C ..8.30912
%C .24
%e Some solutions for n=3 k=4
%e ..4..6..1..9....6..4..9..3....0.11..9..1....0..9..1..3....6..4.10..0
%e .11..3..7..5....8.10..0..7....6..5..3..7....6..8..4..7....9..1..7..3
%e ..2..0.10..8....2..1..5.11....4..8..2.10...10..2.11..5....8..2.11..5
%Y Row 1 is A111942(n+1).
%K nonn,tabl
%O 1,4
%A _R. H. Hardin_, Nov 17 2015
|
