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 A268992 #4 Feb 17 2016 07:24:12 %S A268992 23,278,3331,37987,421450,4583103,49084071,519385102,5442503771, %T A268992 56571775611,584048456162,5994862809815,61225907059807, %U A268992 622579765715526,6306473266306611,63664757730483923,640753995659371194 %N A268992 Number of nX5 binary arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once. %C A268992 Column 5 of A268995. %H A268992 R. H. Hardin, <a href="/A268992/b268992.txt">Table of n, a(n) for n = 1..210</a> %F A268992 Empirical: a(n) = 26*a(n-1) -241*a(n-2) +994*a(n-3) -2060*a(n-4) +2218*a(n-5) -1201*a(n-6) +290*a(n-7) -25*a(n-8) for n>9 %e A268992 Some solutions for n=4 %e A268992 ..0..1..0..0..1. .0..1..0..0..0. .0..1..0..1..1. .0..1..0..0..0 %e A268992 ..0..1..0..0..1. .0..0..0..0..1. .0..1..0..0..0. .0..0..1..0..0 %e A268992 ..1..0..1..0..0. .1..0..0..0..1. .0..0..1..0..0. .1..0..1..1..0 %e A268992 ..1..0..1..0..1. .0..1..0..0..0. .0..0..1..0..0. .0..0..0..0..1 %Y A268992 Cf. A268995. %K A268992 nonn %O A268992 1,1 %A A268992 _R. H. Hardin_, Feb 17 2016