%I #4 Jan 05 2014 12:39:37
%S 256,2400,2400,22500,75744,22500,162000,2691067,2691067,162000,
%T 1166400,64470056,417967682,64470056,1166400,7157160,1538378437,
%U 41170730836,41170730836,1538378437,7157160,43917129,27988093692,3998547995093
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with 2X2 subblock sums lexicographically nondecreasing columnwise and rowwise
%C Table starts
%C .....256........2400...........22500..............162000..............1166400
%C ....2400.......75744.........2691067............64470056...........1538378437
%C ...22500.....2691067.......417967682.........41170730836........3998547995093
%C ..162000....64470056.....41170730836......16811907001604.....6760603592133043
%C .1166400..1538378437...3998547995093....6760603592133043.11272050100248562624
%C .7157160.27988093692.282203684810984.1943970843613005622
%H R. H. Hardin, <a href="/A235261/b235261.txt">Table of n, a(n) for n = 1..49</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 40]
%e Some solutions for n=2 k=4
%e ..0..0..2..0..2....0..0..0..1..3....0..0..0..2..2....0..0..2..2..2
%e ..1..0..2..0..3....1..0..1..0..0....0..0..2..0..3....0..0..1..0..3
%e ..1..0..3..2..0....2..0..3..0..0....0..0..3..3..3....1..0..1..0..1
%Y Column 1 is A204303
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 05 2014