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 A303311 #4 Apr 21 2018 12:46:20 %S A303311 8,7,24,50,139,349,853,2180,5525,13824,34900,88161,221923,559409, %T A303311 1411020,3556271,8964218,22600998,56974213,143622769,362071261, %U A303311 912756908,2300972077,5800604608,14622927344,36863258801,92929626827,234268970653 %N A303311 Number of nX5 0..1 arrays with every element equal to 0, 1, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A303311 Column 5 of A303314. %H A303311 R. H. Hardin, <a href="/A303311/b303311.txt">Table of n, a(n) for n = 1..210</a> %F A303311 Empirical: a(n) = a(n-1) +9*a(n-3) +2*a(n-4) +4*a(n-5) -10*a(n-6) -6*a(n-7) +4*a(n-9) for n>12 %e A303311 Some solutions for n=5 %e A303311 ..0..1..1..1..0. .0..1..0..1..0. .0..0..0..1..0. .0..0..0..1..0 %e A303311 ..0..1..0..1..0. .0..0..1..1..0. .0..1..0..1..0. .0..1..0..1..0 %e A303311 ..0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0 %e A303311 ..0..1..0..1..0. .0..1..0..1..0. .0..0..0..1..0. .0..0..0..1..0 %e A303311 ..0..1..1..1..0. .0..0..0..1..0. .0..1..0..1..0. .1..1..0..1..0 %Y A303311 Cf. A303314. %K A303311 nonn %O A303311 1,1 %A A303311 _R. H. Hardin_, Apr 21 2018