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 A302067 #4 Mar 31 2018 15:43:37 %S A302067 32,855,18108,420121,9825815,230634314,5420105343,127431664603, %T A302067 2996509042607,70465921482502,1657112387922219,38969801181371093, %U A302067 916443418379800057,21551801320879128359,506829233952227257653 %N A302067 Number of nX6 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero. %C A302067 Column 6 of A302069. %H A302067 R. H. Hardin, <a href="/A302067/b302067.txt">Table of n, a(n) for n = 1..210</a> %F A302067 Empirical: a(n) = 64*a(n-1) -1690*a(n-2) +25482*a(n-3) -252419*a(n-4) +1780964*a(n-5) -9433881*a(n-6) +38861751*a(n-7) -127364033*a(n-8) +336753119*a(n-9) -724264377*a(n-10) +1273619361*a(n-11) -1838285081*a(n-12) +2185709769*a(n-13) -2148857927*a(n-14) +1752766341*a(n-15) -1188289983*a(n-16) +668874578*a(n-17) -311073351*a(n-18) +118346399*a(n-19) -36213453*a(n-20) +8679164*a(n-21) -1564108*a(n-22) +198432*a(n-23) -15696*a(n-24) +576*a(n-25) for n>27 %e A302067 Some solutions for n=5 %e A302067 ..0..0..1..1..0..0. .0..0..1..0..0..1. .0..0..1..0..1..1. .0..0..1..0..0..1 %e A302067 ..0..0..1..0..1..1. .0..0..1..0..1..1. .0..0..1..0..0..1. .0..0..1..0..1..1 %e A302067 ..0..0..1..0..1..1. .0..0..1..0..1..1. .0..1..1..0..1..0. .0..1..1..0..1..1 %e A302067 ..0..0..1..0..0..0. .0..0..0..0..1..0. .0..0..1..0..1..0. .0..1..0..0..1..0 %e A302067 ..0..1..0..1..1..0. .1..0..1..0..1..0. .0..1..1..0..1..0. .1..1..1..0..0..1 %Y A302067 Cf. A302069. %K A302067 nonn %O A302067 1,1 %A A302067 _R. H. Hardin_, Mar 31 2018