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 A318341 #4 Aug 24 2018 11:03:35 %S A318341 32,89,160,343,1115,4133,16267,66070,270320,1112195,4584060,18912384, %T A318341 78063418,322286580,1330722690,5494862763,22690219542,93697259411, %U A318341 386917457753,1597759628888,6597895365718,27245818039527,112510877313046 %N A318341 Number of nX6 0..1 arrays with every element unequal to 0, 1, 2 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. %C A318341 Column 6 of A318343. %H A318341 R. H. Hardin, <a href="/A318341/b318341.txt">Table of n, a(n) for n = 1..210</a> %F A318341 Empirical: a(n) = 4*a(n-1) +9*a(n-2) -28*a(n-3) -57*a(n-4) +78*a(n-5) +199*a(n-6) -73*a(n-7) -366*a(n-8) -89*a(n-9) +336*a(n-10) +298*a(n-11) -42*a(n-12) -362*a(n-13) -234*a(n-14) +215*a(n-15) +227*a(n-16) +16*a(n-17) -99*a(n-18) -65*a(n-19) +7*a(n-20) +27*a(n-21) +4*a(n-22) -4*a(n-23) for n>27 %e A318341 Some solutions for n=5 %e A318341 ..0..1..1..1..0..0. .0..1..1..1..1..1. .0..1..1..1..1..1. .0..0..0..0..0..0 %e A318341 ..0..1..1..1..0..0. .1..1..1..1..1..1. .1..0..1..0..1..1. .0..0..1..0..0..0 %e A318341 ..0..1..1..1..0..0. .1..1..1..1..1..1. .1..1..1..1..1..1. .0..0..0..0..0..0 %e A318341 ..0..1..1..1..0..0. .1..0..1..1..0..1. .1..1..1..0..1..1. .0..0..0..0..0..0 %e A318341 ..0..1..1..1..0..0. .1..1..1..1..1..1. .1..1..1..1..1..0. .0..0..0..0..0..1 %Y A318341 Cf. A318343. %K A318341 nonn %O A318341 1,1 %A A318341 _R. H. Hardin_, Aug 24 2018