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 A303079 #4 Apr 18 2018 12:17:42 %S A303079 1,12,32,112,416,1512,5472,19904,72396,263136,956480,3477232,12641136, %T A303079 45954928,167063792,607344064,2207938656,8026742304,29180448720, %U A303079 106082737616,385653691936,1402007389776,5096865080336,18529170684512 %N A303079 Number of nX3 0..1 arrays with every element equal to 0, 2, 3, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A303079 Column 3 of A303084. %H A303079 R. H. Hardin, <a href="/A303079/b303079.txt">Table of n, a(n) for n = 1..210</a> %F A303079 Empirical: a(n) = 5*a(n-1) -7*a(n-2) +14*a(n-3) -24*a(n-4) +4*a(n-5) -12*a(n-6) -8*a(n-7) +12*a(n-8) -24*a(n-9) -4*a(n-10) -8*a(n-11) %e A303079 Some solutions for n=5 %e A303079 ..0..0..1. .0..1..0. .0..1..0. .0..0..1. .0..0..0. .0..0..0. .0..0..0 %e A303079 ..1..0..0. .1..1..1. .1..1..1. .0..0..1. .1..0..1. .1..0..1. .1..0..1 %e A303079 ..0..0..0. .1..1..0. .0..1..0. .0..0..1. .0..0..1. .1..0..0. .0..0..1 %e A303079 ..1..1..1. .1..1..0. .1..1..1. .1..0..0. .0..0..0. .0..0..0. .1..0..0 %e A303079 ..1..1..1. .0..1..1. .1..1..0. .0..0..0. .0..0..1. .1..0..0. .0..0..1 %Y A303079 Cf. A303084. %K A303079 nonn %O A303079 1,2 %A A303079 _R. H. Hardin_, Apr 18 2018