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 A268737 #4 Feb 12 2016 08:44:14 %S A268737 10,145,1788,19591,200204,1971414,18847982,176668038,1629738420, %T A268737 14851460143,133983018272,1198816726867,10652116047394,94092052069550, %U A268737 826903484125628,7234834159717064,63053215344757166,547626807437714177 %N A268737 Number of nX5 binary arrays with some 1 horizontally or vertically adjacent to some other 1 exactly once. %C A268737 Column 5 of A268740. %H A268737 R. H. Hardin, <a href="/A268737/b268737.txt">Table of n, a(n) for n = 1..210</a> %F A268737 Empirical: a(n) = 8*a(n-1) +56*a(n-2) -288*a(n-3) -1506*a(n-4) +870*a(n-5) +7568*a(n-6) -1632*a(n-7) -15481*a(n-8) +4624*a(n-9) +13495*a(n-10) -6192*a(n-11) -4336*a(n-12) +2890*a(n-13) +82*a(n-14) -288*a(n-15) +24*a(n-16) +8*a(n-17) -a(n-18) %e A268737 Some solutions for n=4 %e A268737 ..0..1..1..0..1. .0..1..1..0..0. .0..1..0..0..0. .1..0..1..1..0 %e A268737 ..0..0..0..1..0. .1..0..0..0..0. .1..0..0..0..0. .0..0..0..0..1 %e A268737 ..0..1..0..0..0. .0..1..0..0..0. .0..0..0..0..1. .0..0..0..1..0 %e A268737 ..1..0..0..0..1. .1..0..1..0..0. .1..1..0..0..0. .0..1..0..0..0 %Y A268737 Cf. A268740. %K A268737 nonn %O A268737 1,1 %A A268737 _R. H. Hardin_, Feb 12 2016