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 A297392 #4 Dec 29 2017 10:54:05 %S A297392 6,33,127,700,3175,15541,74736,358341,1729617,8308924,40006463, %T A297392 192481249,926168176,4456879585,21445119255,103193473908,496552428929, %U A297392 2389355832929,11497320733428,55323763675221,266211857683333 %N A297392 Number of nX5 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 neighboring 1. %C A297392 Column 5 of A297395. %H A297392 R. H. Hardin, <a href="/A297392/b297392.txt">Table of n, a(n) for n = 1..210</a> %F A297392 Empirical: a(n) = a(n-1) +8*a(n-2) +27*a(n-3) +77*a(n-4) +164*a(n-5) -4*a(n-6) -124*a(n-7) -71*a(n-8) -231*a(n-9) -293*a(n-10) -114*a(n-11) -16*a(n-12) +2*a(n-13) +40*a(n-14) +98*a(n-15) +32*a(n-16) +16*a(n-17) +5*a(n-18) +a(n-19) -a(n-20) %e A297392 Some solutions for n=5 %e A297392 ..0..0..1..0..0. .1..0..0..0..1. .0..0..1..1..0. .0..0..0..0..0 %e A297392 ..0..0..0..1..0. .0..1..0..1..0. .0..0..0..0..0. .0..0..0..1..0 %e A297392 ..0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..1 %e A297392 ..0..0..0..1..0. .0..0..0..1..0. .0..0..0..0..0. .1..1..0..0..0 %e A297392 ..0..0..1..0..0. .1..1..0..0..1. .1..1..0..0..0. .0..0..0..0..0 %Y A297392 Cf. A297395. %K A297392 nonn %O A297392 1,1 %A A297392 _R. H. Hardin_, Dec 29 2017