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 A301967 #4 Mar 29 2018 13:04:14 %S A301967 16,89,100,169,311,749,1803,4257,10353,25491,62623,154129,380187, %T A301967 938001,2314659,5713631,14105377,34823513,85976895,212277137, %U A301967 524117847,1294070913,3195138873,7889010751,19478522291,48093894353,118747410843 %N A301967 Number of 5Xn 0..1 arrays with every element equal to 0, 1 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero. %C A301967 Row 5 of A301964. %H A301967 R. H. Hardin, <a href="/A301967/b301967.txt">Table of n, a(n) for n = 1..210</a> %F A301967 Empirical: a(n) = 3*a(n-1) -2*a(n-2) +5*a(n-3) -8*a(n-4) +2*a(n-5) -9*a(n-6) +7*a(n-7) -a(n-8) +8*a(n-9) +a(n-10) -4*a(n-11) -3*a(n-13) +2*a(n-14) for n>17 %e A301967 Some solutions for n=5 %e A301967 ..0..1..0..0..1. .0..0..1..0..0. .0..1..1..0..1. .0..1..0..1..0 %e A301967 ..0..1..1..0..1. .1..0..1..1..0. .0..0..1..0..0. .0..0..0..1..0 %e A301967 ..0..0..1..0..1. .1..0..0..1..1. .1..0..1..1..0. .0..1..0..0..0 %e A301967 ..1..1..1..0..1. .1..1..0..0..1. .1..0..0..1..1. .0..1..0..1..1 %e A301967 ..1..0..1..0..0. .0..1..1..0..0. .1..1..0..0..1. .0..1..0..0..1 %Y A301967 Cf. A301964. %K A301967 nonn %O A301967 1,1 %A A301967 _R. H. Hardin_, Mar 29 2018