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 A183738 #7 Oct 06 2015 22:10:07 %S A183738 0,21,21,563,290,563,9403,13169,13169,9403,135578,550268,469254, %T A183738 550268,135578,1814815,19849923,32555965,32555965,19849923,1814815, %U A183738 23204876,667017027,2610816897,3202350892,2610816897,667017027,23204876,287769879 %N A183738 T(n,k) = 1/16 the number of (n+1) X (k+1) 0..7 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 A183738 Adjacent blocks have the same sense when one uses a gap in a shared side as a fall and the other uses it as an increase. %C A183738 Table starts %C A183738 ...........0.............21..............563..............9403 %C A183738 ..........21............290............13169............550268 %C A183738 .........563..........13169...........469254..........32555965 %C A183738 ........9403.........550268.........32555965........3202350892 %C A183738 ......135578.......19849923.......2610816897......470757143497 %C A183738 .....1814815......667017027.....211915469907....85938883577009 %C A183738 ....23204876....21320890377...16635894447271.16327766532728500 %C A183738 ...287769879...659741463420.1270931982853879 %C A183738 ..3491293862.19939380387212 %C A183738 .41667398364 %H A183738 R. H. Hardin, <a href="/A183738/b183738.txt">Table of n, a(n) for n = 1..60</a> %K A183738 nonn,tabl %O A183738 1,2 %A A183738 _R. H. Hardin_, Jan 06 2011