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