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 A297505 #4 Dec 31 2017 07:27:45 %S A297505 37,2097,34757,1247716,35049871,978288822,28914051279,823340493402, %T A297505 23748019543354,684563956136832,19685697905900807,567106229569054219, %U A297505 16326031115140984900,470031756510991757935,13533758185630160222532 %N A297505 Number of nX7 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 2 neighboring 1s. %C A297505 Column 7 of A297506. %H A297505 R. H. Hardin, <a href="/A297505/b297505.txt">Table of n, a(n) for n = 1..210</a> %e A297505 Some solutions for n=3 %e A297505 ..1..0..0..0..1..1..0. .0..0..1..1..1..1..0. .0..0..1..1..0..1..1 %e A297505 ..0..1..1..0..0..0..1. .1..1..0..0..0..0..0. .0..0..0..0..0..1..1 %e A297505 ..0..0..0..0..0..1..0. .0..1..0..1..1..0..0. .0..0..0..0..0..0..0 %Y A297505 Cf. A297506. %K A297505 nonn %O A297505 1,1 %A A297505 _R. H. Hardin_, Dec 31 2017