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 A304268 #4 May 09 2018 10:13:32 %S A304268 13,13,37,116,404,1246,3788,12342,39252,122156,388150,1234248,3885916, %T A304268 12284744,38942904,123064868,388956186,1231020108,3893434762, %U A304268 12310010474,38938978286,123164661778,389498928546,1231896735244,3896353516054 %N A304268 Number of nX6 0..1 arrays with every element unequal to 0, 1, 5 or 8 king-move adjacent elements, with upper left element zero. %C A304268 Column 6 of A304270. %H A304268 R. H. Hardin, <a href="/A304268/b304268.txt">Table of n, a(n) for n = 1..210</a> %F A304268 Empirical: a(n) = a(n-1) +2*a(n-2) +16*a(n-3) +7*a(n-4) -14*a(n-5) -45*a(n-6) -14*a(n-7) +5*a(n-8) +38*a(n-9) +13*a(n-10) -6*a(n-11) -6*a(n-12) for n>13 %e A304268 Some solutions for n=5 %e A304268 ..0..0..0..0..0..0. .0..0..0..1..0..0. .0..0..0..0..0..0. .0..0..1..0..0..0 %e A304268 ..0..1..0..0..0..0. .0..0..0..0..0..0. .0..0..0..0..0..0. .0..0..0..0..0..1 %e A304268 ..0..0..0..0..0..1. .0..0..0..0..0..0. .0..0..0..0..0..0. .0..0..0..0..0..0 %e A304268 ..0..0..0..0..0..0. .0..0..0..0..0..0. .0..1..0..0..1..0. .0..0..0..0..0..0 %e A304268 ..0..1..0..0..0..0. .0..1..0..0..1..0. .0..0..0..0..0..0. .0..0..0..0..1..0 %Y A304268 Cf. A304270. %K A304268 nonn %O A304268 1,1 %A A304268 _R. H. Hardin_, May 09 2018