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 A302161 #4 Apr 02 2018 14:47:58 %S A302161 13,65,34,109,296,635,1563,3948,9405,22602,55730,135448,327429,798275, %T A302161 1944498,4720205,11478126,27935558,67913732,165112453,401615997, %U A302161 976675958,2374829337,5775344378,14045080684,34154018024,83055854601 %N A302161 Number of nX6 0..1 arrays with every element equal to 0, 1 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A302161 Column 6 of A302163. %H A302161 R. H. Hardin, <a href="/A302161/b302161.txt">Table of n, a(n) for n = 1..210</a> %F A302161 Empirical: a(n) = a(n-1) +a(n-2) +8*a(n-3) -5*a(n-5) -17*a(n-6) -2*a(n-7) +6*a(n-8) +10*a(n-9) +a(n-10) -a(n-11) +a(n-12) -a(n-14) -a(n-15) for n>26 %e A302161 Some solutions for n=5 %e A302161 ..0..1..1..0..1..0. .0..1..0..1..0..1. .0..1..1..0..1..0. .0..1..0..1..0..1 %e A302161 ..1..0..1..0..1..0. .0..1..0..1..1..0. .1..0..1..0..1..0. .1..1..0..1..0..0 %e A302161 ..1..0..1..0..1..0. .0..1..1..0..1..0. .1..0..1..0..1..1. .0..1..0..1..0..1 %e A302161 ..1..0..1..0..1..1. .1..0..1..0..1..0. .0..0..1..0..1..0. .0..1..0..1..0..1 %e A302161 ..1..0..1..0..1..0. .1..0..1..0..0..1. .1..0..1..0..1..0. .0..1..0..0..1..1 %Y A302161 Cf. A302163. %K A302161 nonn %O A302161 1,1 %A A302161 _R. H. Hardin_, Apr 02 2018