|
%I #5 Mar 31 2012 12:36:56
%S 244,998,3716,14068,53354,201506,761710,2880986,10892888,41189884,
%T 155750096,588937240,2226948992,8420752636,31841355064,120401617098,
%U 455274228532,1721526894432,6509603831244,24614743024468,93075644971226
%N Number of (n+2)X4 binary arrays avoiding patterns 010 and 101 in rows, columns and nw-to-se diagonals
%C Column 2 of A203355
%H R. H. Hardin, <a href="/A203349/b203349.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 5*a(n-1) -2*a(n-2) -10*a(n-3) -a(n-4) +3*a(n-5) +6*a(n-6) +9*a(n-7) +47*a(n-8) -54*a(n-9) -107*a(n-10) +152*a(n-11) +159*a(n-12) -177*a(n-13) -118*a(n-14) +227*a(n-15) +122*a(n-16) -174*a(n-17) -189*a(n-18) +47*a(n-19) +159*a(n-20) -20*a(n-21) -151*a(n-22) -92*a(n-23) -18*a(n-24) +20*a(n-25) +22*a(n-26) +9*a(n-27) +a(n-28) -a(n-29) -a(n-30) for n>31
%e Some solutions for n=3
%e ..0..1..1..0....0..0..1..1....0..0..0..0....1..1..1..0....0..0..0..0
%e ..0..1..1..0....0..0..0..0....0..0..0..0....1..1..0..0....0..0..0..1
%e ..1..1..1..0....0..0..0..0....0..0..1..1....1..0..0..0....1..1..1..1
%e ..1..1..1..0....1..0..0..0....0..1..1..1....1..0..0..0....1..1..1..1
%e ..0..0..0..1....1..0..0..0....0..1..1..1....1..0..0..0....1..1..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Dec 31 2011
| 