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 A268993 #4 Feb 17 2016 07:24:59 %S A268993 41,763,14080,244397,4097199,66954420,1073436321,16957258387, %T A268993 264744926212,4093941136805,62806688095479,957111538353668, %U A268993 14502245681077257,218656000387543867,3282569954305098964 %N A268993 Number of nX6 binary arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once. %C A268993 Column 6 of A268995. %H A268993 R. H. Hardin, <a href="/A268993/b268993.txt">Table of n, a(n) for n = 1..210</a> %F A268993 Empirical: a(n) = 42*a(n-1) -665*a(n-2) +5138*a(n-3) -21972*a(n-4) +55274*a(n-5) -83769*a(n-6) +76202*a(n-7) -40273*a(n-8) +11304*a(n-9) -1296*a(n-10) for n>12 %e A268993 Some solutions for n=3 %e A268993 ..0..1..0..0..0..1. .1..0..1..0..0..1. .0..0..0..0..0..0. .0..0..1..0..1..0 %e A268993 ..0..1..0..0..0..0. .1..0..0..0..0..1. .1..0..0..0..0..0. .1..0..0..0..1..1 %e A268993 ..1..0..0..0..1..0. .0..1..1..0..0..1. .1..0..0..0..1..0. .0..0..0..0..0..0 %Y A268993 Cf. A268995. %K A268993 nonn %O A268993 1,1 %A A268993 _R. H. Hardin_, Feb 17 2016