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 A268746 #4 Feb 12 2016 12:31:11 %S A268746 13,89,623,4110,26334,165019,1016807,6183665,37209717,221970102, %T A268746 1314544140,7737069617,45297553803,263980824665,1532201345489, %U A268746 8861529601362,51088246525260,293694819166095,1684057081243885 %N A268746 Number of nX4 binary arrays with some element plus some horizontally or vertically adjacent neighbor totalling two no more than once. %C A268746 Column 4 of A268750. %H A268746 R. H. Hardin, <a href="/A268746/b268746.txt">Table of n, a(n) for n = 1..210</a> %F A268746 Empirical: a(n) = 8*a(n-1) +2*a(n-2) -82*a(n-3) -49*a(n-4) +124*a(n-5) +39*a(n-6) -58*a(n-7) -6*a(n-8) +8*a(n-9) -a(n-10) %e A268746 Some solutions for n=4 %e A268746 ..0..1..0..0. .0..0..0..0. .0..0..0..0. .0..0..0..1. .0..1..0..1 %e A268746 ..0..0..0..1. .1..0..0..0. .1..0..0..1. .0..0..0..0. .1..0..1..0 %e A268746 ..1..0..0..0. .0..0..1..0. .0..1..0..0. .1..0..0..0. .0..0..0..0 %e A268746 ..1..0..0..1. .1..0..1..0. .1..0..1..0. .0..0..0..0. .0..0..1..0 %Y A268746 Cf. A268750. %K A268746 nonn %O A268746 1,1 %A A268746 _R. H. Hardin_, Feb 12 2016