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 A296951 #4 Dec 22 2017 11:09:39 %S A296951 13,608,5763,86139,1898178,29067775,482228052,8786244680,148081034460, %T A296951 2527093956658,44081436520906,756410616073885,13001520369777372, %U A296951 224610561730578221,3867018822679814785,66587006212100036798 %N A296951 Number of nX7 0..1 arrays with each 1 adjacent to 1, 3 or 5 king-move neighboring 1s. %C A296951 Column 7 of A296952. %H A296951 R. H. Hardin, <a href="/A296951/b296951.txt">Table of n, a(n) for n = 1..210</a> %e A296951 Some solutions for n=4 %e A296951 ..0..1..0..0..0..1..0. .0..1..0..1..1..0..0. .0..1..1..0..0..0..0 %e A296951 ..0..1..0..0..0..0..1. .1..0..0..0..0..0..0. .0..1..1..0..0..0..0 %e A296951 ..0..0..0..0..0..0..0. .0..0..1..1..1..1..1. .0..0..0..0..1..1..1 %e A296951 ..0..1..1..0..1..1..0. .0..0..0..0..1..0..0. .0..0..0..0..1..1..1 %Y A296951 Cf. A296952. %K A296951 nonn %O A296951 1,1 %A A296951 _R. H. Hardin_, Dec 22 2017