|
%I #8 Dec 11 2015 11:45:53
%S 81,246,7812,580986,101596896,41869995708,40724629633188,
%T 93574975249028022,508279521493590763140,6529777647254616589112172,
%U 198475392061658571459051861720,14277440032279343277552357109481028
%N Number of (n+1) X (n+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.
%C Diagonal of A206150.
%H R. H. Hardin, <a href="/A206142/b206142.txt">Table of n, a(n) for n = 1..13</a>
%e Some solutions for n=4:
%e ..2..1..0..2..1....0..2..1..2..0....1..2..0..2..0....0..1..0..1..2
%e ..0..2..1..0..2....1..0..2..1..2....0..1..2..1..2....1..0..1..0..1
%e ..1..0..2..1..0....0..2..1..0..1....1..2..0..2..0....0..1..0..1..2
%e ..2..1..0..2..1....1..0..2..1..0....0..1..2..0..2....1..2..1..2..1
%e ..0..2..1..0..2....2..1..0..2..1....1..0..1..2..1....0..1..0..1..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 04 2012
| 