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 A297302 #4 Dec 27 2017 21:16:54 %S A297302 1,1,8,19,49,157,600,2161,7479,25639,88307,306281,1066691,3716461, %T A297302 12931923,44953528,156232914,543075295,1888104965,6564738537, %U A297302 22824408491,79353796243,275886391011,959166284191,3334724626513,11593837466750 %N A297302 Number of 5Xn 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 2 neighboring 1s. %C A297302 Row 5 of A297299. %H A297302 R. H. Hardin, <a href="/A297302/b297302.txt">Table of n, a(n) for n = 1..210</a> %F A297302 Empirical: a(n) = 7*a(n-1) -21*a(n-2) +42*a(n-3) -56*a(n-4) +67*a(n-5) -40*a(n-6) -48*a(n-7) +185*a(n-8) -212*a(n-9) +185*a(n-10) -144*a(n-11) -37*a(n-12) +221*a(n-13) -238*a(n-14) -59*a(n-15) +a(n-16) +399*a(n-17) -152*a(n-18) -295*a(n-19) +284*a(n-20) +163*a(n-21) -349*a(n-22) -328*a(n-23) +203*a(n-24) +273*a(n-25) +58*a(n-26) -102*a(n-27) -59*a(n-28) +8*a(n-29) +11*a(n-30) +4*a(n-31) -2*a(n-32) for n>37 %e A297302 Some solutions for n=5 %e A297302 ..0..0..0..1..1. .0..0..0..0..0. .0..0..0..0..0. .0..1..1..0..0 %e A297302 ..0..0..1..1..0. .0..0..0..1..1. .0..1..1..0..0. .1..1..0..0..0 %e A297302 ..0..0..0..0..0. .0..0..1..1..0. .1..1..0..0..0. .0..0..1..1..0 %e A297302 ..0..0..0..0..0. .0..0..0..1..1. .0..0..0..0..0. .0..1..1..0..0 %e A297302 ..0..0..0..0..0. .0..0..1..1..0. .0..0..0..0..0. .0..0..0..0..0 %Y A297302 Cf. A297299. %K A297302 nonn %O A297302 1,3 %A A297302 _R. H. Hardin_, Dec 27 2017