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 A266105 #4 Dec 21 2015 08:23:35 %S A266105 1,105,1012,4893,53442,841668,9880139,100419691,1161577640, %T A266105 14330198186,167677854928,1911970639884,22299927996030, %U A266105 263303415557409,3080790433186207,35842524252682997,418663357107133083 %N A266105 Number of 5Xn integer arrays with each element equal to the number of horizontal and antidiagonal neighbors exactly one smaller than itself. %C A266105 Row 5 of A266101. %H A266105 R. H. Hardin, <a href="/A266105/b266105.txt">Table of n, a(n) for n = 1..210</a> %e A266105 Some solutions for n=4 %e A266105 ..1..0..0..0....0..0..1..2....0..0..0..1....0..1..1..0....0..0..1..1 %e A266105 ..0..0..0..0....0..2..1..1....0..0..1..2....2..1..1..2....1..2..0..1 %e A266105 ..1..2..0..0....0..0..0..1....0..1..1..1....0..1..1..0....0..0..1..2 %e A266105 ..1..0..0..1....1..1..1..1....1..0..0..0....2..1..0..1....0..2..1..1 %e A266105 ..1..2..1..0....1..0..0..1....0..0..0..1....2..1..1..0....0..0..0..0 %Y A266105 Cf. A266101. %K A266105 nonn %O A266105 1,2 %A A266105 _R. H. Hardin_, Dec 21 2015