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 A183728 #8 May 27 2021 09:10:55 %S A183728 88331,3528126,130610844,5355252106,221403152762,9546147995730, %T A183728 460509744129719,33429749952933774,4646656755908387234, %U A183728 935845545638421963156 %N A183728 1/12 the number of (n+1) X 9 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 A183728 Column 8 of A183729. %e A183728 Some solutions with the first block increasing clockwise for 3 X 9: %e A183728 ..1..2..1..0..1..5..2..5..1....1..2..1..0..1..0..1..4..5 %e A183728 ..0..3..4..5..2..4..3..4..3....0..3..4..5..3..4..2..3..2 %e A183728 ..1..2..1..0..1..5..2..1..2....1..2..1..0..1..5..1..5..1 %e A183728 ... %e A183728 ...R..L..L..R..L..R..L..R.......R..L..L..R..L..R..L..R... %e A183728 ...L..R..R..L..R..L..R..L.......L..R..R..L..R..L..R..L... %Y A183728 Cf. A183729. %K A183728 nonn %O A183728 1,1 %A A183728 _R. H. Hardin_, Jan 06 2011