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 A207456 #11 Jun 23 2018 07:21:27 %S A207456 10,100,270,1450,5200,23530,92610,396100,1610950,6754210,27799200, %T A207456 115710130,478341370,1985702500,8222193630,34098329530,141276194800, %U A207456 585672013210,2427100765650,10060368444100,41694947333590 %N A207456 Number of 5 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 1 vertically. %C A207456 Row 5 of A207453. %H A207456 R. H. Hardin, <a href="/A207456/b207456.txt">Table of n, a(n) for n = 1..210</a> %F A207456 Empirical: a(n) = a(n-1) + 13*a(n-2) + 4*a(n-3) - 16*a(n-4). %F A207456 Empirical g.f.: 10*x*(1 + 9*x + 4*x^2 - 16*x^3) / (1 - x - 13*x^2 - 4*x^3 + 16*x^4). - _Colin Barker_, Jun 23 2018 %e A207456 Some solutions for n=5: %e A207456 1 1 1 1 1 1 0 1 1 0 0 1 0 1 0 0 1 0 1 0 %e A207456 1 1 1 1 1 1 1 0 1 1 1 1 0 1 0 1 1 0 1 0 %e A207456 0 1 0 1 1 0 1 0 1 0 1 1 0 1 0 0 1 0 1 0 %e A207456 0 1 0 1 0 0 1 0 1 0 1 1 0 1 0 0 1 0 1 0 %e A207456 0 1 0 1 0 0 1 0 1 0 1 1 0 1 0 0 1 0 1 0 %Y A207456 Cf. A207453. %K A207456 nonn %O A207456 1,1 %A A207456 _R. H. Hardin_, Feb 17 2012