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 A303200 #4 Apr 19 2018 13:41:06 %S A303200 16,21,62,185,523,2106,7425,23976,77199,278516,970352,3224100, %T A303200 10748487,37400625,128931566,434968863,1468892487,5046611020, %U A303200 17300239256,58747284770,199467828264,682129604278,2332060352220,7940005050689 %N A303200 Number of 5Xn 0..1 arrays with every element equal to 0, 1, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A303200 Row 5 of A303197. %H A303200 R. H. Hardin, <a href="/A303200/b303200.txt">Table of n, a(n) for n = 1..210</a> %e A303200 Some solutions for n=5 %e A303200 ..0..0..1..1..0. .0..1..0..0..1. .0..1..0..1..0. .0..1..1..0..1 %e A303200 ..0..1..0..1..0. .0..1..0..1..0. .0..0..0..1..1. .1..0..1..0..1 %e A303200 ..0..1..0..1..0. .0..1..0..1..0. .0..1..1..1..1. .1..0..1..0..1 %e A303200 ..0..0..0..1..1. .1..0..0..1..0. .0..1..0..1..0. .0..1..1..0..1 %e A303200 ..1..1..0..1..0. .1..0..1..0..0. .0..1..0..0..1. .0..1..0..1..1 %Y A303200 Cf. A303197. %K A303200 nonn %O A303200 1,1 %A A303200 _R. H. Hardin_, Apr 19 2018