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 A301910 #4 Mar 28 2018 16:12:25 %S A301910 32,1,43,26,64,532,1934,14860,86638,568382,4029337,27834481,195991786, %T A301910 1379526983,9716584311,68484812620,482477672626,3399467195980, %U A301910 23952754983718,168772425373008,1189219611175938,8379671227164002 %N A301910 Number of 6Xn 0..1 arrays with every element equal to 0, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero. %C A301910 Row 6 of A301906. %H A301910 R. H. Hardin, <a href="/A301910/b301910.txt">Table of n, a(n) for n = 1..210</a> %e A301910 Some solutions for n=5 %e A301910 ..0..1..1..0..1. .0..1..1..0..0. .0..1..1..0..0. .0..1..1..0..1 %e A301910 ..1..1..1..0..1. .1..1..0..0..0. .1..1..0..0..1. .1..1..1..0..1 %e A301910 ..0..1..1..0..1. .1..1..1..0..0. .0..1..1..0..0. .0..1..1..0..0 %e A301910 ..1..1..1..0..1. .0..1..1..0..0. .1..1..0..0..1. .0..1..0..0..1 %e A301910 ..0..1..1..0..0. .0..1..1..0..0. .1..1..1..0..0. .1..1..1..0..0 %e A301910 ..1..1..0..0..1. .1..1..0..0..1. .1..1..0..0..1. .1..1..0..0..1 %Y A301910 Cf. A301906. %K A301910 nonn %O A301910 1,1 %A A301910 _R. H. Hardin_, Mar 28 2018