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 A268763 #4 Feb 13 2016 07:35:58 %S A268763 10,105,762,5170,32056,193573,1129042,6475898,36505596,203462597, %T A268763 1122256900,6140903312,33367393732,180252797855,968778729426, %U A268763 5183858768244,27630592631158,146768594783741,777214421588348 %N A268763 Number of nX5 binary arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two exactly once. %C A268763 Column 5 of A268766. %H A268763 R. H. Hardin, <a href="/A268763/b268763.txt">Table of n, a(n) for n = 1..210</a> %F A268763 Empirical: a(n) = 4*a(n-1) +28*a(n-2) -62*a(n-3) -314*a(n-4) +78*a(n-5) +867*a(n-6) +6*a(n-7) -859*a(n-8) +46*a(n-9) +215*a(n-10) -8*a(n-11) -16*a(n-12) %e A268763 Some solutions for n=4 %e A268763 ..1..0..1..0..0. .1..0..0..0..1. .1..0..0..0..0. .0..0..0..0..0 %e A268763 ..0..0..0..0..0. .0..0..1..0..1. .0..0..1..0..1. .0..0..0..0..0 %e A268763 ..1..0..0..0..0. .0..0..0..0..0. .0..1..0..0..0. .0..1..0..1..0 %e A268763 ..0..1..0..0..1. .1..0..0..0..1. .0..0..0..1..0. .1..0..0..0..0 %Y A268763 Cf. A268766. %K A268763 nonn %O A268763 1,1 %A A268763 _R. H. Hardin_, Feb 13 2016