|
%I #5 Jan 26 2014 05:00:36
%S 256,2116,17258,136208,1080984,8564392,67897642,538065184,4265291002,
%T 33804568568,267953875076,2123741832432,16833511636310,
%U 133421518052528,1057529601925106,8382006062940352,66437217185516568,526585866692093976
%N Number of (n+1)X(1+1) 0..3 arrays colored with the difference of the maximum and minimum in each 2X2 subblock
%C Column 1 of A236451
%H R. H. Hardin, <a href="/A236445/b236445.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 32*a(n-2) +90*a(n-3) +846*a(n-4) +2418*a(n-5) +3809*a(n-6) +5178*a(n-7) +3384*a(n-8) +3328*a(n-9) +1024*a(n-10) +512*a(n-11) for n>13
%e Some solutions for n=4
%e ..2..0....2..0....1..3....0..3....0..0....2..3....1..2....2..3....1..0....2..0
%e ..0..1....3..1....1..0....1..1....1..3....3..3....2..3....2..0....0..1....1..2
%e ..1..0....3..2....2..2....0..0....2..3....1..2....0..0....1..2....2..0....1..1
%e ..1..2....1..0....3..2....3..2....1..0....1..2....0..0....1..1....3..1....1..1
%e ..1..1....2..0....0..1....1..1....0..0....0..0....2..3....0..2....1..2....3..3
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 26 2014
| 