cp's OEIS Frontend

A264638 T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 4.

%I A264638 #4 Nov 19 2015 07:28:22
%S A264638 1,1,1,2,3,1,4,28,16,1,12,400,960,128,2,36,7776,107568,46656,1152,4,
%T A264638 144,229392,21565440,71663616,4561920,12960,8,576,9082368,10027929600,
%U A264638 229132800000,98288640000,829440000,269568,16,2880,481406976
%N A264638 T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 4.
%C A264638 Table starts
%C A264638 ..1......1.........2...........4...........12..........36...........144
%C A264638 ..1......3........28.........400.........7776......229392.......9082368
%C A264638 ..1.....16.......960......107568.....21565440.10027929600.7163873280000
%C A264638 ..1....128.....46656....71663616.229132800000
%C A264638 ..2...1152...4561920.98288640000
%C A264638 ..4..12960.829440000
%C A264638 ..8.269568
%C A264638 .16
%H A264638 R. H. Hardin, <a href="/A264638/b264638.txt">Table of n, a(n) for n = 1..39</a>
%e A264638 Some solutions for n=3 k=4
%e A264638 ..4..8..1..9....0..4..8..1....0..4..5..1....0..2..5..3....4..8..6..0
%e A264638 ..0..6..2..5...10..2..7..9....2..8.11..9....8.10..1..7...10..9..7..5
%e A264638 .10..7.11..3....6.11..3..5....6.10..3..7....4..6..9.11....2..1.11..3
%Y A264638 Row 1 is A111942(n+1).
%K A264638 nonn,tabl
%O A264638 1,4
%A A264638 _R. H. Hardin_, Nov 19 2015