%I #4 Jan 19 2014 08:32:29
%S 256,3096,3096,37584,91128,37584,455808,2692656,2692656,455808,
%T 5529360,79581792,193943760,79581792,5529360,67071552,2351803200,
%U 13978797888,13978797888,2351803200,67071552,813596592,69503976144,1007315423208
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the sets of distinct values in every 2X2 subblock
%C Table starts
%C ........256..........3096..........37584..........455808.........5529360
%C .......3096.........91128........2692656........79581792......2351803200
%C ......37584.......2692656......193943760.....13978797888...1007315423208
%C .....455808......79581792....13978797888...2461372831152.433044403286448
%C ....5529360....2351803200..1007315423208.433044403286448
%C ...67071552...69503976144.72595539982248
%C ..813596592.2054050501536
%C .9869111712
%H R. H. Hardin, <a href="/A236123/b236123.txt">Table of n, a(n) for n = 1..40</a>
%F Empirical for column k:
%F k=1: a(n) = 6*a(n-1) +59*a(n-2) +164*a(n-3) +264*a(n-4) +96*a(n-5) -144*a(n-6)
%F k=2: [order 21]
%e Some solutions for n=2 k=4
%e ..0..0..3..1..2....0..0..0..2..3....0..0..0..2..3....0..0..3..1..3
%e ..0..0..3..3..0....0..0..1..2..0....0..0..3..2..3....0..0..1..3..2
%e ..0..1..0..0..1....0..2..2..1..1....0..1..2..1..0....0..2..3..2..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 19 2014