|
%I #5 Mar 31 2012 12:37:20
%S 13,169,336,824,1648,4160,8892,19710,44868,100056,224792,497348,
%T 1123364,2520128,5603808,12569064,28201200,63082040,140941364,
%U 315874560,707891088,1582568420,3541951148,7935579276,17763012916,39742042856
%N Number of nX5 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 0 and 1 1 1 vertically
%C Column 5 of A207879
%H R. H. Hardin, <a href="/A207876/b207876.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = a(n-2) +8*a(n-3) +7*a(n-4) -28*a(n-6) -4*a(n-7) +19*a(n-8) +36*a(n-9) -24*a(n-10) -18*a(n-11) -6*a(n-12) +10*a(n-14) for n>20
%e Some solutions for n=4
%e ..1..0..0..1..0....1..0..0..1..0....0..1..0..0..1....1..0..0..1..1
%e ..1..1..0..0..1....0..1..1..1..0....1..0..0..1..0....0..0..1..0..0
%e ..0..1..0..0..1....1..1..1..0..0....1..0..0..1..0....1..1..1..0..0
%e ..1..0..0..1..0....1..0..0..1..0....0..1..1..0..0....1..1..0..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 21 2012
| 