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 A297223 #4 Dec 27 2017 15:37:16 %S A297223 13,145,1513,16658,178469,1918732,20599895,221333623,2377449633, %T A297223 25538644681,274338521973,2946944060015,31656188524253, %U A297223 340051734132151,3652845905487029,39238984432264619,421506370243881833 %N A297223 Number of nX7 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 neighboring 1s. %C A297223 Column 7 of A297224. %H A297223 R. H. Hardin, <a href="/A297223/b297223.txt">Table of n, a(n) for n = 1..210</a> %F A297223 Empirical: a(n) = a(n-1) +60*a(n-2) +410*a(n-3) +804*a(n-4) -206*a(n-5) -4210*a(n-6) -136*a(n-7) -4099*a(n-8) -6059*a(n-9) +20146*a(n-10) +14506*a(n-11) -16052*a(n-12) +4656*a(n-13) -228*a(n-14) -100*a(n-15) +12*a(n-16) for n>21 %e A297223 Some solutions for n=5 %e A297223 ..0..0..0..0..0..0..0. .0..0..0..0..0..0..0. .0..0..0..1..0..1..0 %e A297223 ..0..1..1..0..0..1..1. .0..0..0..0..0..1..1. .0..0..1..0..1..0..0 %e A297223 ..0..0..0..0..0..0..0. .0..0..0..0..0..0..0. .0..0..0..0..0..0..1 %e A297223 ..1..1..0..0..0..0..0. .0..1..0..1..0..0..0. .0..1..1..0..0..1..0 %e A297223 ..0..1..1..0..0..0..0. .1..0..1..0..1..1..0. .0..0..0..0..0..0..0 %Y A297223 Cf. A297224. %K A297223 nonn %O A297223 1,1 %A A297223 _R. H. Hardin_, Dec 27 2017