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 A297764 #6 May 10 2021 00:50:56 %S A297764 1,4,52,206,734,4088,24801,130159,666434,3560105,19245643,102730864, %T A297764 546125038,2913904858,15571288925,83122383401,443489006259, %U A297764 2366877041892,12634189755271,67434790018093,359910312437155,1920940558913908 %N A297764 Number of 3 X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 4 neighboring 1's. %C A297764 Row 3 of A297762. %H A297764 R. H. Hardin, <a href="/A297764/b297764.txt">Table of n, a(n) for n = 1..210</a> %F A297764 Empirical: a(n) = 6*a(n-1) -5*a(n-2) +8*a(n-3) +53*a(n-4) -295*a(n-5) -76*a(n-6) +556*a(n-7) +178*a(n-8) +196*a(n-9) +145*a(n-10) -779*a(n-11) -628*a(n-12) +226*a(n-13) +100*a(n-14) +275*a(n-15) +152*a(n-16) -65*a(n-17) -32*a(n-18) -26*a(n-19) -4*a(n-20). %e A297764 Some solutions for n=7 %e A297764 ..0..0..0..0..1..1..0. .0..1..1..1..1..1..0. .0..0..0..0..1..0..0 %e A297764 ..1..1..1..0..1..1..1. .0..1..1..1..1..0..1. .0..0..0..1..1..1..0 %e A297764 ..0..1..1..1..1..1..0. .0..0..0..0..0..1..0. .0..0..1..1..1..0..0 %Y A297764 Cf. A297762. %K A297764 nonn %O A297764 1,2 %A A297764 _R. H. Hardin_, Jan 05 2018