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 A269032 #4 Feb 18 2016 08:57:14 %S A269032 96,672,9528,115656,1326576,14710368,159397596,1698064656,17853542544, %T A269032 185754411168,1916112393912,19623814814640,199755193119372, %U A269032 2022721445384448,20388967766219208,204700225563136152 %N A269032 Number of nX5 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two exactly once. %C A269032 Column 5 of A269035. %H A269032 R. H. Hardin, <a href="/A269032/b269032.txt">Table of n, a(n) for n = 1..210</a> %F A269032 Empirical: a(n) = 28*a(n-1) -286*a(n-2) +1290*a(n-3) -2373*a(n-4) +304*a(n-5) +3551*a(n-6) -2846*a(n-7) -546*a(n-8) +1308*a(n-9) -505*a(n-10) +76*a(n-11) -4*a(n-12) for n>13 %e A269032 Some solutions for n=4 %e A269032 ..2..0..1..0..0. .0..1..2..1..0. .0..0..0..0..1. .2..1..2..2..1 %e A269032 ..1..2..1..0..1. .2..1..2..1..2. .1..0..0..0..0. .2..1..2..1..2 %e A269032 ..1..0..1..2..1. .2..1..2..1..0. .0..0..0..0..1. .0..1..2..2..2 %e A269032 ..0..0..1..2..2. .0..2..2..1..2. .0..0..0..1..0. .0..1..2..2..2 %Y A269032 Cf. A269035. %K A269032 nonn %O A269032 1,1 %A A269032 _R. H. Hardin_, Feb 18 2016