|
%I #7 Oct 06 2015 22:03:46
%S 87,388,1790,14886,272215,7319684,200260149,5355252106,139489865583,
%T 3561214845505,89499710973670,2221523267475056,54589402697720455,
%U 1330321340313497085,32193928583886647023,774480659129262018036
%N 1/12 the number of (n+1) X 5 0..5 arrays with every 2 X 2 subblock strictly increasing clockwise or counterclockwise with one decrease, and at least two adjacent blocks having the same increasing direction.
%C Column 4 of A183729.
%H R. H. Hardin, <a href="/A183724/b183724.txt">Table of n, a(n) for n = 1..200</a>
%e Some solutions with the first block increasing clockwise for 3 X 5:
%e ..0..1..2..1..2....2..4..3..2..4....0..1..2..1..2....5..0..4..5..0
%e ..5..4..3..5..4....1..5..0..1..0....5..4..3..5..3....2..1..3..2..1
%e ..0..1..2..1..2....2..4..3..2..3....0..1..2..0..2....3..0..4..5..0
%e ...
%e ...R..R..L..R.......R..L..L..R.......R..R..L..R.......R..L..R..R...
%e ...L..L..R..L.......L..R..R..L.......L..L..R..L.......L..R..L..L...
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 06 2011
| 