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 A303198 #4 Apr 19 2018 13:39:44 %S A303198 4,6,12,23,43,105,233,479,968,2146,4683,9928,20709,44652,96244,205631, %T A303198 435063,930935,1994977,4266607,9080728,19396626,41471567,88657284, %U A303198 189124509,403873550,862832200,1843730503,3936307111,8406314159 %N A303198 Number of 3Xn 0..1 arrays with every element equal to 0, 1, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A303198 Row 3 of A303197. %H A303198 R. H. Hardin, <a href="/A303198/b303198.txt">Table of n, a(n) for n = 1..210</a> %F A303198 Empirical: a(n) = a(n-1) +a(n-2) +12*a(n-4) -6*a(n-5) -7*a(n-6) -3*a(n-7) -26*a(n-8) +9*a(n-9) +14*a(n-10) +5*a(n-11) +18*a(n-12) -5*a(n-13) -9*a(n-14) -2*a(n-15) -3*a(n-16) +a(n-17) +a(n-18) for n>19 %e A303198 Some solutions for n=5 %e A303198 ..0..0..1..0..1. .0..1..0..1..0. .0..1..0..1..1. .0..1..1..1..0 %e A303198 ..0..1..0..0..1. .0..1..0..0..0. .1..1..0..0..0. .0..1..0..0..0 %e A303198 ..0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0 %Y A303198 Cf. A303197. %K A303198 nonn %O A303198 1,1 %A A303198 _R. H. Hardin_, Apr 19 2018