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 A269086 #4 Feb 19 2016 09:21:45 %S A269086 23,191,1531,11314,80422,555789,3761534,25063389,164926651,1074440360, %T A269086 6941695514,44537043804,284052377508,1802408061740,11386034886784, %U A269086 71645923776799,449267054051740,2808501899850347,17508131088788801 %N A269086 Number of nX5 binary arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once. %C A269086 Column 5 of A269089. %H A269086 R. H. Hardin, <a href="/A269086/b269086.txt">Table of n, a(n) for n = 1..210</a> %F A269086 Empirical: a(n) = 2*a(n-1) +41*a(n-2) +54*a(n-3) -509*a(n-4) -2182*a(n-5) -2830*a(n-6) +1766*a(n-7) +7914*a(n-8) +2584*a(n-9) -10583*a(n-10) -6092*a(n-11) +11506*a(n-12) +5348*a(n-13) -11688*a(n-14) -620*a(n-15) +9251*a(n-16) -4462*a(n-17) -3137*a(n-18) +4774*a(n-19) -2365*a(n-20) +338*a(n-21) +198*a(n-22) -106*a(n-23) +12*a(n-24) +4*a(n-25) -a(n-26) %e A269086 Some solutions for n=4 %e A269086 ..0..0..1..0..1. .1..0..0..1..1. .0..0..0..1..0. .1..0..0..0..0 %e A269086 ..0..0..0..0..1. .0..0..0..0..0. .0..0..0..1..0. .0..1..0..1..0 %e A269086 ..1..0..1..0..0. .0..0..0..0..0. .1..0..0..0..0. .0..0..1..0..0 %e A269086 ..0..0..0..1..0. .1..0..1..0..1. .0..0..1..0..0. .0..0..0..0..1 %Y A269086 Cf. A269089. %K A269086 nonn %O A269086 1,1 %A A269086 _R. H. Hardin_, Feb 19 2016