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 A269072 #4 Feb 19 2016 08:42:02 %S A269072 23,185,1887,17713,165607,1529241,14011359,127528641,1154377943, %T A269072 10400164377,93314875007,834244316721,7434343205095,66061046189497, %U A269072 585498663953471,5177144091416833,45680435610848791,402277442193052665 %N A269072 Number of nX5 binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once. %C A269072 Column 5 of A269075. %H A269072 R. H. Hardin, <a href="/A269072/b269072.txt">Table of n, a(n) for n = 1..210</a> %F A269072 Empirical: a(n) = 24*a(n-1) -198*a(n-2) +584*a(n-3) +137*a(n-4) -2864*a(n-5) +1132*a(n-6) +4336*a(n-7) -1391*a(n-8) -2280*a(n-9) +90*a(n-10) +200*a(n-11) -25*a(n-12) %e A269072 Some solutions for n=4 %e A269072 ..0..1..0..0..1. .1..0..0..1..0. .1..0..1..0..1. .1..0..1..0..1 %e A269072 ..1..0..0..0..1. .1..0..1..0..0. .1..0..1..0..0. .0..0..1..0..1 %e A269072 ..1..0..0..0..0. .1..0..0..0..1. .0..0..0..0..1. .0..1..0..0..1 %e A269072 ..0..0..0..0..1. .0..0..0..0..1. .0..0..0..1..0. .0..0..0..0..1 %Y A269072 Cf. A269075. %K A269072 nonn %O A269072 1,1 %A A269072 _R. H. Hardin_, Feb 19 2016