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 A268765 #4 Feb 13 2016 07:37:40 %S A268765 38,595,8500,99057,1129042,12111209,127676872,1312123185,13311824510, %T A268765 133228716170,1321110678618,12988699400546,126844585914726, %U A268765 1231361200765123,11893679949360102,114371480492930683 %N A268765 Number of nX7 binary arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two exactly once. %C A268765 Column 7 of A268766. %H A268765 R. H. Hardin, <a href="/A268765/b268765.txt">Table of n, a(n) for n = 1..210</a> %F A268765 Empirical: a(n) = 12*a(n-1) +64*a(n-2) -942*a(n-3) -1476*a(n-4) +26868*a(n-5) +2249*a(n-6) -376788*a(n-7) +333472*a(n-8) +2686292*a(n-9) -4376424*a(n-10) -8985248*a(n-11) +21881197*a(n-12) +12658940*a(n-13) -55768960*a(n-14) +923990*a(n-15) +80699088*a(n-16) -25850884*a(n-17) -69171189*a(n-18) +34934900*a(n-19) +34833816*a(n-20) -22502076*a(n-21) -9502460*a(n-22) +7752808*a(n-23) +1023260*a(n-24) -1356480*a(n-25) +55136*a(n-26) +94080*a(n-27) -14400*a(n-28) %e A268765 Some solutions for n=4 %e A268765 ..1..0..0..0..0..1..0. .0..0..0..0..0..1..1. .0..0..0..0..1..0..0 %e A268765 ..0..0..0..1..0..0..1. .1..0..1..0..0..0..0. .1..0..1..0..0..1..0 %e A268765 ..0..0..0..0..0..0..0. .0..0..0..0..0..0..0. .0..0..0..0..0..0..0 %e A268765 ..0..0..1..0..1..0..0. .0..1..0..0..1..0..0. .0..0..1..0..0..0..1 %Y A268765 Cf. A268766. %K A268765 nonn %O A268765 1,1 %A A268765 _R. H. Hardin_, Feb 13 2016