|
%I #7 Oct 06 2015 22:04:32
%S 537,4170,30939,272215,3723606,112949014,4858574535,221403152762,
%T 9949950285008,439077020908186,19070687313534907,817844594324788300,
%U 34712759917922473170,1460861248287305883035,61042039866448977229798
%N 1/12 the number of (n+1) X 6 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 5 of A183729.
%H R. H. Hardin, <a href="/A183725/b183725.txt">Table of n, a(n) for n = 1..125</a>
%e Some solutions with the first block increasing clockwise for 3 X 6:
%e ..0..1..0..5..0..3....2..3..1..2..3..1....0..1..5..0..1..4....1..2..0..1..2..0
%e ..3..2..3..4..1..2....0..5..0..5..4..5....4..3..4..3..2..3....4..3..5..4..3..5
%e ..4..1..0..5..0..4....3..4..1..2..3..1....5..1..5..0..1..0....0..2..0..1..2..0
%e ...
%e ...R..L..L..R..L.......R..L..R..R..L.......R..L..R..R..L.......R..L..R..R..L...
%e ...L..R..R..L..R.......L..R..L..L..R.......L..R..L..L..R.......L..R..L..L..R...
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 06 2011
| 