%I #5 Mar 31 2012 12:36:42
%S 5,10,10,17,10,17,15,41,41,15,8,295,296,295,8,61,159,4238,4238,159,61,
%T 206,4587,3602,30157,3602,4587,206,410,8476,249211,96844,96844,249211,
%U 8476,410,426,33401,1055902,6814915,2579473,6814915,1055902,33401,426
%N T(n,k)=Number of nXk 0..4 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other
%C Table starts
%C ...5.....10........17.........15..........8..........61........206.........410
%C ..10.....10........41........295........159........4587.......8476.......33401
%C ..17.....41.......296.......4238.......3602......249211....1055902.....8657121
%C ..15....295......4238......30157......96844.....6814915..221032490..3642791292
%C ...8....159......3602......96844....2579473....78447852.2410888256.76028824895
%C ..61...4587....249211....6814915...78447852.21586894705
%C .206...8476...1055902..221032490.2410888256
%C .410..33401...8657121.3642791292
%C .426.272191.141222119
%C .228.128622
%H R. H. Hardin, <a href="/A201033/b201033.txt">Table of n, a(n) for n = 1..71</a>
%e Some solutions for n=5 k=3
%e ..0..0..1....0..1..3....0..1..1....0..0..1....0..0..0....0..1..1....0..1..2
%e ..0..4..2....0..1..3....0..2..3....0..2..1....2..2..4....0..4..2....0..1..3
%e ..1..3..2....0..1..4....0..4..2....3..4..4....1..3..4....0..4..2....0..2..4
%e ..2..3..3....2..3..4....2..3..4....1..2..3....1..3..3....1..3..4....1..4..3
%e ..1..4..4....2..2..4....1..4..3....2..4..3....1..2..4....2..3..3....2..4..3
%Y Column 1 is A200940
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Nov 26 2011
