|
%I #5 Mar 31 2012 12:36:49
%S 804,3906,22018,127405,755743,4512712,27083790,162834668,980088758,
%T 5901773754,35547767796,214137547797,1290032760320,7771799443119,
%U 46821922365444,282085134351092,1699467525972993,10238736958233298
%N Number of (n+2)X5 binary arrays avoiding patterns 001 and 100 in rows, columns and nw-to-se diagonals
%C Column 3 of A202591
%H R. H. Hardin, <a href="/A202586/b202586.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 8*a(n-1) +5*a(n-2) -119*a(n-3) -33*a(n-4) +836*a(n-5) +541*a(n-6) -3476*a(n-7) -3205*a(n-8) +8025*a(n-9) +9061*a(n-10) -10518*a(n-11) -10948*a(n-12) +8562*a(n-13) -1477*a(n-14) -3794*a(n-15) +16795*a(n-16) +767*a(n-17) -20117*a(n-18) +1608*a(n-19) +13413*a(n-20) -3578*a(n-21) -5053*a(n-22) +2527*a(n-23) +1063*a(n-24) -1072*a(n-25) +8*a(n-26) +236*a(n-27) -56*a(n-28) -12*a(n-29) +4*a(n-30) for n>31
%e Some solutions for n=3
%e ..1..1..1..1..1....1..1..1..1..1....0..1..1..1..0....1..0..1..1..1
%e ..0..1..0..1..0....0..1..0..1..1....1..1..0..1..1....1..1..1..1..0
%e ..1..1..1..1..1....1..1..1..1..0....1..0..1..1..0....1..1..1..1..1
%e ..1..1..1..1..1....1..1..0..1..1....0..1..1..1..1....0..1..1..1..0
%e ..1..0..1..1..0....0..1..1..1..0....1..1..1..1..0....1..1..0..1..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Dec 21 2011
| 