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 A302008 #4 Mar 30 2018 12:51:31 %S A302008 32,2048,102544,5276816,270990144,13918667808,714887543376, %T A302008 36717919842624,1885898831169344,96863178142358672, %U A302008 4975068186720184080,255528508742343929504,13124406807998548541168,674093293580517672325808 %N A302008 Number of nX6 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero. %C A302008 Column 6 of A302010. %H A302008 R. H. Hardin, <a href="/A302008/b302008.txt">Table of n, a(n) for n = 1..210</a> %F A302008 Empirical: a(n) = 45*a(n-1) +324*a(n-2) +190*a(n-3) -2434*a(n-4) -3156*a(n-5) +5467*a(n-6) +5122*a(n-7) -6753*a(n-8) +1356*a(n-9) -16*a(n-10) for n>12 %e A302008 Some solutions for n=5 %e A302008 ..0..0..0..1..1..0. .0..0..0..1..1..0. .0..0..0..0..1..0. .0..0..0..0..0..1 %e A302008 ..0..0..1..1..1..0. .0..0..1..1..0..0. .0..0..1..1..0..0. .0..0..1..0..1..1 %e A302008 ..0..0..0..1..0..0. .0..0..1..1..0..1. .0..0..0..1..1..1. .0..0..1..1..0..1 %e A302008 ..0..0..1..0..1..1. .0..0..1..1..0..0. .0..0..1..1..0..0. .0..0..0..0..1..1 %e A302008 ..0..0..1..1..1..0. .0..0..0..1..1..1. .0..0..0..0..0..1. .0..0..1..1..0..1 %Y A302008 Cf. A302010. %K A302008 nonn %O A302008 1,1 %A A302008 _R. H. Hardin_, Mar 30 2018