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 A302160 #4 Apr 02 2018 14:47:20 %S A302160 8,25,20,51,140,280,621,1451,3189,7136,16179,36212,81254,182957, %T A302160 410889,922943,2074950,4662563,10476618,23545560,52912545,118903861, %U A302160 267210837,600490496,1349441183,3032538210,6814874446,15314690189,34415928927 %N A302160 Number of nX5 0..1 arrays with every element equal to 0, 1 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A302160 Column 5 of A302163. %H A302160 R. H. Hardin, <a href="/A302160/b302160.txt">Table of n, a(n) for n = 1..210</a> %F A302160 Empirical: a(n) = a(n-1) +a(n-2) +7*a(n-3) -3*a(n-4) -3*a(n-5) -14*a(n-6) +3*a(n-7) +2*a(n-8) +9*a(n-9) -2*a(n-10) -2*a(n-12) for n>15 %e A302160 Some solutions for n=5 %e A302160 ..0..1..0..1..0. .0..1..0..1..0. .0..1..1..0..1. .0..0..1..0..1 %e A302160 ..0..1..0..1..1. .0..1..0..1..1. .1..0..1..0..0. .0..1..0..0..1 %e A302160 ..0..1..0..1..0. .0..1..0..1..0. .1..0..1..0..1. .0..1..0..1..0 %e A302160 ..0..1..0..1..0. .0..1..0..1..0. .1..0..1..0..1. .1..1..0..1..0 %e A302160 ..0..0..1..1..0. .0..1..0..1..0. .1..0..1..1..0. .0..1..0..1..0 %Y A302160 Cf. A302163. %K A302160 nonn %O A302160 1,1 %A A302160 _R. H. Hardin_, Apr 02 2018