|
%I #4 Nov 19 2016 12:55:29
%S 0,0,0,0,0,0,0,59,59,0,6,1465,3766,1465,6,77,19047,184341,184341,
%T 19047,77,504,194726,5897660,16073852,5897660,194726,504,2304,1734714,
%U 138641633,1185617520,1185617520,138641633,1734714,2304,8350,13506810
%N T(n,k)=Number of nXk 0..2 arrays with rows and columns in lexicographic nondecreasing order but with exactly three mistakes.
%C Table starts
%C .....0.........0..............0..................0......................6
%C .....0.........0.............59...............1465..................19047
%C .....0........59...........3766.............184341................5897660
%C .....0......1465.........184341...........16073852.............1185617520
%C .....6.....19047........5897660.........1185617520...........202543496074
%C ....77....194726......138641633........71569971497.........30875729085512
%C ...504...1734714.....2705568336......3591161445506.......4136952690048454
%C ..2304..13506810....46817185633....156509651392363.....487193123130350097
%C ..8350..91496261...733865213852...6152096549069001...51331437862178906035
%C .25653.543067118.10436129552575.222794729697445622.4945011895747787547937
%H R. H. Hardin, <a href="/A278372/b278372.txt">Table of n, a(n) for n = 1..127</a>
%F Empirical for column k:
%F k=1: [polynomial of degree 11]
%F k=2: [polynomial of degree 35]
%F k=3: [polynomial of degree 107]
%e Some solutions for n=3 k=4
%e ..0..2..2..2. .2..0..2..1. .2..0..2..0. .1..0..2..0. .2..1..0..1
%e ..0..1..1..1. .0..0..1..0. .0..2..1..1. .0..1..1..1. .0..1..1..1
%e ..0..1..0..0. .2..0..1..2. .1..0..1..0. .0..1..2..0. .1..2..0..2
%K nonn,tabl
%O 1,8
%A _R. H. Hardin_, Nov 19 2016
| 