|
%I #5 Mar 31 2012 12:37:19
%S 15,225,611,2163,8575,27931,88243,288813,926949,2927115,9278885,
%T 29390445,92717065,292337359,921806095,2904391209,9147369231,
%U 28808166663,90713456051,285607327515,899181685831,2830809676285,8911643119525
%N Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically
%C Column 5 of A207729
%H R. H. Hardin, <a href="/A207726/b207726.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 4*a(n-1) -3*a(n-2) +10*a(n-3) -27*a(n-4) -6*a(n-5) -15*a(n-6) +51*a(n-7) +41*a(n-8) +31*a(n-9) -51*a(n-10) -29*a(n-11) -27*a(n-12) +15*a(n-13) +6*a(n-14) +3*a(n-15) -4*a(n-16) +a(n-17) +a(n-19)
%e Some solutions for n=4
%e ..1..0..1..1..1....1..0..1..1..1....1..0..1..1..0....0..0..1..1..0
%e ..1..0..1..1..0....0..1..1..1..1....1..0..1..1..1....1..0..1..1..0
%e ..1..0..1..1..0....0..0..1..1..1....0..0..1..1..0....0..1..1..1..1
%e ..0..1..1..0..1....1..0..1..1..1....0..1..1..0..0....0..0..1..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 19 2012
| 