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 A302065 #4 Mar 31 2018 15:42:15 %S A302065 8,81,748,7070,67070,636852,6048836,57457232,545796112,5184660760, %T A302065 49250608992,467846412016,4444215843808,42216967044320, %U A302065 401031909830432,3809525073635904,36187846859821376,343759454672598656 %N A302065 Number of nX4 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero. %C A302065 Column 4 of A302069. %H A302065 R. H. Hardin, <a href="/A302065/b302065.txt">Table of n, a(n) for n = 1..210</a> %F A302065 Empirical: a(n) = 16*a(n-1) -76*a(n-2) +148*a(n-3) -124*a(n-4) +36*a(n-5) for n>6 %e A302065 Some solutions for n=5 %e A302065 ..0..1..0..1. .0..0..1..0. .0..0..1..0. .0..1..0..0. .0..1..1..0 %e A302065 ..1..0..1..0. .1..0..1..1. .1..0..1..1. .0..1..0..0. .1..1..1..1 %e A302065 ..1..0..1..0. .0..1..0..1. .1..0..0..1. .1..1..0..0. .1..0..0..0 %e A302065 ..0..1..0..1. .1..1..0..1. .1..1..1..0. .0..1..0..1. .1..1..0..0 %e A302065 ..1..1..0..0. .1..1..0..1. .0..0..0..1. .0..1..0..0. .1..1..1..1 %Y A302065 Cf. A302069. %K A302065 nonn %O A302065 1,1 %A A302065 _R. H. Hardin_, Mar 31 2018