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 A297312 #4 Dec 28 2017 07:25:58 %S A297312 21,654,13937,340825,8273245,200646607,4869858862,118156684121, %T A297312 2867120332406,69570025944705,1688108287602302,40961748924233513, %U A297312 993931518658886393,24117625902266425892,585211158099440381626 %N A297312 Number of nX6 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 or 2 neighboring 1s. %C A297312 Column 6 of A297314. %H A297312 R. H. Hardin, <a href="/A297312/b297312.txt">Table of n, a(n) for n = 1..210</a> %F A297312 Empirical: a(n) = 9*a(n-1) +324*a(n-2) +1428*a(n-3) -6254*a(n-4) -30323*a(n-5) +97813*a(n-6) +136166*a(n-7) -925019*a(n-8) +1597152*a(n-9) -1178936*a(n-10) +88497*a(n-11) +390484*a(n-12) -218599*a(n-13) +44101*a(n-14) -18308*a(n-15) -28030*a(n-16) +15541*a(n-17) +1362*a(n-18) -1947*a(n-19) +200*a(n-20) +84*a(n-21) -16*a(n-22) for n>25 %e A297312 Some solutions for n=5 %e A297312 ..0..0..1..1..0..0. .0..0..1..1..0..0. .0..0..0..1..1..1. .0..0..0..0..0..0 %e A297312 ..0..0..0..1..0..0. .0..0..1..1..0..0. .0..0..0..0..0..1. .0..0..0..1..0..0 %e A297312 ..0..0..1..0..0..0. .0..0..0..0..0..0. .0..0..0..0..1..1. .0..0..1..0..0..0 %e A297312 ..0..0..0..0..0..0. .0..0..1..1..1..0. .0..0..0..0..1..1. .0..0..0..1..0..0 %e A297312 ..0..0..1..1..1..1. .0..1..0..1..1..1. .0..1..1..0..1..1. .0..0..1..0..1..1 %Y A297312 Cf. A297314. %K A297312 nonn %O A297312 1,1 %A A297312 _R. H. Hardin_, Dec 28 2017