|
%I #5 Mar 31 2012 12:37:09
%S 1338,20400,295392,4256868,61165512,878480541,12614174310,
%T 181122252378,2600608213794,37340291401455,536141282064960,
%U 7698053759356941,110530579472265720,1587025853728342719,22786914622304193330
%N Number of (n+1)X4 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one
%C Column 3 of A206054
%H R. H. Hardin, <a href="/A206049/b206049.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 14*a(n-1) +50*a(n-2) -694*a(n-3) +231*a(n-4) +7859*a(n-5) -11033*a(n-6) -27843*a(n-7) +74031*a(n-8) -31227*a(n-9) -69492*a(n-10) +85038*a(n-11) -5841*a(n-12) -45285*a(n-13) +32933*a(n-14) -7422*a(n-15) -7010*a(n-16) +3796*a(n-17) -416*a(n-18)
%e Some solutions for n=4
%e ..0..1..2..1....1..0..1..1....0..2..0..2....2..2..1..1....1..1..1..1
%e ..0..1..1..1....2..0..1..2....2..2..2..2....0..2..2..0....1..0..0..0
%e ..0..1..2..0....2..0..1..1....0..0..2..0....1..1..2..0....1..2..2..0
%e ..1..1..2..2....2..0..1..2....1..2..2..0....2..1..2..0....2..2..0..0
%e ..1..2..2..0....2..0..1..2....2..2..0..0....1..1..2..2....2..0..0..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 03 2012
| 