|
%I #5 Mar 31 2012 12:37:20
%S 14,196,932,3923,15839,66089,274310,1137227,4717144,19562408,81137237,
%T 336532615,1395776345,5789011066,24010216811,99583798522,413029045498,
%U 1713057493953,7104991166089,29468317523707,122221341928692
%N Number of 5Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 0 vertically
%C Row 5 of A207960
%H R. H. Hardin, <a href="/A207963/b207963.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = a(n-1) +3*a(n-2) +27*a(n-3) +52*a(n-4) +69*a(n-5) -35*a(n-6) -285*a(n-7) -495*a(n-8) -186*a(n-9) +721*a(n-10) +1173*a(n-11) +105*a(n-12) -1194*a(n-13) -703*a(n-14) +560*a(n-15) +572*a(n-16) -197*a(n-17) -382*a(n-18) -68*a(n-19) +154*a(n-20) +117*a(n-21) -a(n-22) -18*a(n-23) +6*a(n-24) +3*a(n-25) +3*a(n-27) -a(n-29) -a(n-30) -a(n-31) for n>33
%e Some solutions for n=4
%e ..1..1..0..0....1..0..0..1....1..0..0..1....1..0..0..1....0..0..1..0
%e ..1..0..0..1....0..1..0..0....1..0..0..1....0..1..1..0....1..0..0..1
%e ..0..1..0..0....1..0..0..1....1..0..0..1....1..1..1..1....0..0..1..0
%e ..1..0..0..1....1..1..0..0....1..0..0..1....0..1..0..0....1..0..0..1
%e ..0..1..0..0....1..0..0..1....1..0..0..1....1..1..1..1....0..0..1..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 21 2012
| 