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 A268736 #4 Feb 12 2016 08:42:09 %S A268736 5,48,396,2876,19591,128232,816009,5087814,31228804,189328186, %T A268736 1136393919,6764778660,39991075367,235019630164,1374139675314, %U A268736 7998875575940,46380134987289,267999333435856,1543818690094499,8868640131544198 %N A268736 Number of nX4 binary arrays with some 1 horizontally or vertically adjacent to some other 1 exactly once. %C A268736 Column 4 of A268740. %H A268736 R. H. Hardin, <a href="/A268736/b268736.txt">Table of n, a(n) for n = 1..210</a> %F A268736 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 A268736 Some solutions for n=4 %e A268736 ..0..0..1..0. .1..0..1..0. .0..0..0..0. .0..0..0..0. .0..1..0..0 %e A268736 ..1..0..0..0. .0..0..0..0. .1..0..0..1. .1..1..0..1. .1..0..0..1 %e A268736 ..0..1..0..1. .0..0..0..0. .1..0..1..0. .0..0..1..0. .0..0..0..1 %e A268736 ..0..1..0..0. .1..1..0..0. .0..0..0..0. .0..0..0..0. .0..0..1..0 %Y A268736 Cf. A268740. %K A268736 nonn %O A268736 1,1 %A A268736 _R. H. Hardin_, Feb 12 2016