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 A303253 #4 Apr 20 2018 11:08:50 %S A303253 8,1934,21843,584333,13529019,322544617,7600681910,181926316054, %T A303253 4319287740641,102749087683745,2445959829763007,58194271138697372, %U A303253 1384700107834934771,32952218084019479209,784117840394793531854 %N A303253 Number of nX7 0..1 arrays with every element equal to 1, 2, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A303253 Column 7 of A303254. %H A303253 R. H. Hardin, <a href="/A303253/b303253.txt">Table of n, a(n) for n = 1..210</a> %e A303253 Some solutions for n=5 %e A303253 ..0..1..1..0..1..1..1. .0..1..1..0..0..1..1. .0..0..1..1..1..1..1 %e A303253 ..0..0..0..0..1..0..0. .0..0..0..1..1..0..1. .0..1..0..1..0..0..1 %e A303253 ..0..0..0..0..0..0..0. .0..1..0..0..0..0..1. .0..0..0..0..0..1..0 %e A303253 ..0..0..1..1..1..0..1. .0..0..1..1..1..1..0. .0..0..1..1..0..1..1 %e A303253 ..0..0..0..0..1..1..0. .0..0..0..0..0..0..1. .0..0..0..0..0..0..1 %Y A303253 Cf. A303254. %K A303253 nonn %O A303253 1,1 %A A303253 _R. H. Hardin_, Apr 20 2018