%I #4 Nov 23 2016 15:15:42
%S 0,0,0,0,0,0,1,395,395,1,56,16224,53360,16224,56,728,354696,5985658,
%T 5985658,354696,728,5328,6208804,442089480,1608427228,442089480,
%U 6208804,5328,27876,94510277,23974522382,371601597959,371601597959,23974522382
%N T(n,k)=Number of nXk 0..3 arrays with rows and columns in lexicographic nondecreasing order but with exactly three mistakes.
%C Table starts
%C .....0..........0..............0...................1......................56
%C .....0..........0............395...............16224..................354696
%C .....0........395..........53360.............5985658...............442089480
%C .....1......16224........5985658..........1608427228............371601597959
%C ....56.....354696......442089480........371601597959.........267157122056196
%C ...728....6208804....23974522382......70116431548595......170796560376996116
%C ..5328...94510277..1079873605870...10962535851392548....95557122165321489360
%C .27876.1235465691.43032494710944.1484609498751465944.46856747385448318164254
%H R. H. Hardin, <a href="/A278610/b278610.txt">Table of n, a(n) for n = 1..97</a>
%F Empirical for column k:
%F k=1: [polynomial of degree 15]
%F k=2: [polynomial of degree 63]
%e Some solutions for n=3 k=4
%e ..0..3..3..1. .0..3..2..3. .0..3..2..0. .0..1..1..0. .0..3..0..3
%e ..0..1..0..0. .0..2..2..1. .0..1..3..3. .0..1..0..1. .0..2..2..2
%e ..1..2..0..1. .0..0..3..0. .1..1..0..1. .0..3..3..0. .0..0..0..2
%K nonn,tabl
%O 1,8
%A _R. H. Hardin_, Nov 23 2016
|