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 A297579 #4 Jan 01 2018 11:09:47 %S A297579 6,39,188,1017,5800,31171,171543,945046,5175491,28425138,156104665, %T A297579 856754888,4703782455,25823973877,141766379306,778286514143, %U A297579 4272707870336,23456587740397,128773952953874,706953473963971 %N A297579 Number of nX5 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 4 neighboring 1s. %C A297579 Column 5 of A297582. %H A297579 R. H. Hardin, <a href="/A297579/b297579.txt">Table of n, a(n) for n = 1..210</a> %F A297579 Empirical: a(n) = 2*a(n-1) +8*a(n-2) +65*a(n-3) +24*a(n-4) -109*a(n-5) -708*a(n-6) -460*a(n-7) +1188*a(n-8) +1178*a(n-9) +1813*a(n-10) -509*a(n-11) -2484*a(n-12) -3623*a(n-13) -998*a(n-14) +974*a(n-15) +4136*a(n-16) +3611*a(n-17) +746*a(n-18) -1268*a(n-19) -2677*a(n-20) -2205*a(n-21) -330*a(n-22) +30*a(n-23) +347*a(n-24) +205*a(n-25) -45*a(n-26) +46*a(n-27) +66*a(n-28) +8*a(n-29) -8*a(n-30) %e A297579 Some solutions for n=7 %e A297579 ..0..1..0..1..0. .0..0..0..0..0. .0..0..0..0..1. .0..0..1..0..0 %e A297579 ..0..0..1..1..0. .1..1..0..0..0. .0..0..0..1..0. .0..0..0..1..0 %e A297579 ..1..0..0..1..0. .0..0..0..0..0. .0..0..0..0..0. .0..1..0..1..0 %e A297579 ..0..1..0..1..0. .0..1..1..0..0. .1..0..0..0..0. .0..1..1..1..0 %e A297579 ..0..0..0..0..1. .0..0..0..0..0. .0..1..0..0..0. .0..0..0..0..0 %e A297579 ..0..1..0..0..1. .0..1..0..0..1. .0..0..0..0..0. .0..0..1..0..0 %e A297579 ..1..0..0..1..0. .1..0..0..1..0. .0..0..0..1..1. .0..1..0..0..0 %Y A297579 Cf. A297582. %K A297579 nonn %O A297579 1,1 %A A297579 _R. H. Hardin_, Jan 01 2018