This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A183722 #7 Oct 06 2015 22:02:46 %S A183722 1,2,29,388,4170,41423,388998,3528126,31206553,270945278,2318825000, %T A183722 19619049541,164448364546,1367755750914,11301610770163,92861669073522, %U A183722 759320826126174,6182626278886591,50153160109476104,405492870969390486 %N A183722 1/12 the number of (n+1) X 3 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 A183722 Column 2 of A183729. %H A183722 R. H. Hardin, <a href="/A183722/b183722.txt">Table of n, a(n) for n = 1..200</a> %F A183722 Empirical: a(n)=14*a(n-1)-36*a(n-2)-115*a(n-3)+125*a(n-4)+164*a(n-5)-155*a(n-6)-29*a(n-7)+34*a(n-8)+a(n-9)-2*a(n-10). %e A183722 Some solutions with the first block increasing clockwise for 5 X 3: %e A183722 ..2..4..3....4..0..3....1..4..2....1..2..1....1..2..1....1..3..2....3..5..4 %e A183722 ..1..0..1....2..1..2....0..5..0....0..5..0....0..3..0....5..4..5....2..1..2 %e A183722 ..2..5..2....3..0..3....1..4..1....1..4..1....5..4..5....0..3..0....3..0..3 %e A183722 ..3..4..3....4..5..4....2..3..2....2..3..2....0..2..0....1..2..1....4..5..4 %e A183722 ..1..5..1....1..0..2....0..4..0....5..4..1....5..3..4....4..3..5....2..1..2 %e A183722 ... %e A183722 ...R..L.......R..L.......R..L.......R..L.......R..L.......R..L.......R..L... %e A183722 ...L..R.......L..R.......L..R.......L..R.......R..L.......L..R.......L..R... %e A183722 ...L..R.......L..R.......L..R.......L..R.......L..R.......L..R.......L..R... %e A183722 ...R..L.......R..L.......R..L.......R..L.......R..L.......R..L.......R..L... %K A183722 nonn %O A183722 1,2 %A A183722 _R. H. Hardin_, Jan 06 2011