login
T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having no more than two equal edges, and new values 0..3 introduced in row major order
7

%I #5 Mar 31 2012 12:37:11

%S 15,151,151,1990,6329,1990,27548,294983,294983,27548,383021,13804578,

%T 47155911,13804578,383021,5327971,643832706,7524874363,7524874363,

%U 643832706,5327971,74147694,30049504156,1197873588223,4089691428777

%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having no more than two equal edges, and new values 0..3 introduced in row major order

%C Table starts

%C .........15............151..............1990...............27548

%C ........151...........6329............294983............13804578

%C .......1990.........294983..........47155911..........7524874363

%C ......27548.......13804578........7524874363.......4089691428777

%C .....383021......643832706.....1197873588223....2216692870846655

%C ....5327971....30049504156...190817902385518.1202272856786461731

%C ...74147694..1402595823865.30394990249581088

%C .1031960617.65463971182963

%H R. H. Hardin, <a href="/A206366/b206366.txt">Table of n, a(n) for n = 1..49</a>

%e Some solutions for n=4 k=3

%e ..0..0..1..1....0..0..0..0....0..0..0..0....0..0..0..0....0..1..1..0

%e ..2..1..2..0....1..2..3..2....1..2..1..2....1..2..1..2....0..1..2..1

%e ..2..0..3..0....2..1..2..1....0..0..0..0....0..1..2..0....3..2..1..1

%e ..0..2..1..1....1..3..2..0....3..1..2..3....3..3..0..1....1..0..3..2

%e ..0..2..1..0....3..3..0..1....1..0..3..2....0..1..2..1....3..3..0..0

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_ Feb 06 2012