|
%I #7 Dec 13 2015 01:14:42
%S 2457,69585,2073999,62351943,1876995285,56515649709,1701726564411,
%T 51240524315871,1542900272261037,46458185448564093,
%U 1398899935206593883,42122201449345396239,1268339366974860798957,38190899219543171363901
%N Number of (n+1) X 4 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an equal number of clockwise and counterclockwise edge increases.
%C Column 3 of A206414.
%H R. H. Hardin, <a href="/A206409/b206409.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 47*a(n-1) -608*a(n-2) +3198*a(n-3) -5911*a(n-4) -7789*a(n-5) +44215*a(n-6) -38455*a(n-7) -50916*a(n-8) +86298*a(n-9) +5407*a(n-10) -54221*a(n-11) +10208*a(n-12) +11424*a(n-13) -2506*a(n-14) -502*a(n-15) +112*a(n-16).
%e Some solutions for n=4:
%e ..1..1..1..1....0..1..2..0....2..1..1..1....0..0..1..2....1..2..0..2
%e ..1..0..1..2....1..0..1..2....2..1..1..2....1..0..1..1....1..1..2..2
%e ..1..0..0..1....1..1..2..0....1..1..1..1....0..2..0..0....1..2..2..1
%e ..2..1..0..0....0..1..2..2....1..2..2..1....0..0..1..0....2..0..2..2
%e ..0..2..1..0....2..0..1..1....2..2..1..0....2..2..0..1....2..0..0..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 07 2012
| 