|
%I #5 Mar 31 2012 12:37:09
%S 24,78,78,228,300,228,722,980,980,722,2136,3706,2728,3706,2136,6688,
%T 12304,12068,12068,12304,6688,19976,45810,33572,64224,33572,45810,
%U 19976,62048,154346,150396,211824,211824,150396,154346,62048,186560,567112
%N T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero
%C Table starts
%C ....24.....78.....228......722.....2136......6688......19976.......62048
%C ....78....300.....980.....3706....12304.....45810.....154346......567112
%C ...228....980....2728....12068....33572....150396.....419108.....1895206
%C ...722...3706...12068....64224...211824...1159120....3850160....21563332
%C ..2136..12304...33572...211824...566288...3844878...10015204....72882376
%C ..6688..45810..150396..1159120..3844878..32546974..107546742...986871314
%C .19976.154346..419108..3850160.10015204.107546742..262845336..3293852332
%C .62048.567112.1895206.21563332.72882376.986871314.3293852332.51670233144
%H R. H. Hardin, <a href="/A206010/b206010.txt">Table of n, a(n) for n = 1..312</a>
%e Some solutions for n=4 k=3
%e ..1..0..1..1....1..1..1..0....1..2..1..1....0..1..0..2....2..2..2..1
%e ..1..1..1..2....1..2..1..2....1..1..1..0....1..1..1..1....1..2..1..1
%e ..2..1..2..2....2..2..2..2....1..2..1..2....2..1..2..0....1..1..1..0
%e ..2..2..2..1....1..2..0..2....1..1..1..1....2..2..2..2....0..1..2..2
%e ..2..0..1..1....2..2..2..2....0..1..2..0....0..1..2..1....1..1..1..2
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Feb 02 2012
| 