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 A266132 #4 Dec 21 2015 12:29:49 %S A266132 1,9,25,49,149,625,2141,5433,17269,65249,214877,600025,1934485, %T A266132 6961153,22488637,66171721,214994149,746222545,2392193165,7273608601, %U A266132 23705004725,80233190113,256613628509,797094034921,2598493640773,8647653815601 %N A266132 Number of 2Xn integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself. %C A266132 Row 2 of A266131. %H A266132 R. H. Hardin, <a href="/A266132/b266132.txt">Table of n, a(n) for n = 1..210</a> %F A266132 Empirical: a(n) = a(n-1) +8*a(n-3) +80*a(n-4) -40*a(n-5) -52*a(n-6) -112*a(n-7) -1204*a(n-8) +292*a(n-9) +64*a(n-10) -880*a(n-11) +4016*a(n-12) -2112*a(n-13) -1152*a(n-14) +1024*a(n-15) -4608*a(n-16) +4608*a(n-17) %e A266132 Some solutions for n=4 %e A266132 ..1..2..0..1....1..1..1..2....1..1..1..1....1..1..0..1....0..2..0..1 %e A266132 ..0..0..1..1....0..0..1..2....1..0..0..1....1..0..2..0....1..0..1..1 %Y A266132 Cf. A266131. %K A266132 nonn %O A266132 1,2 %A A266132 _R. H. Hardin_, Dec 21 2015