%I #4 Jun 12 2012 07:49:11
%S 353,22506,615561,12773955,237475982,4198162231,72188618371,
%T 1220298706370,20395481622380,338170996357600,5574396540683306,
%U 91481580201645051,1496133943774251078,24401386122053197406
%N Number of 0..3 arrays of length 2*n+5 with sum less than 3*n in any length 2n subsequence (=less than 50% duty cycle)
%C Row 6 of A213464
%H R. H. Hardin, <a href="/A213470/b213470.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..2....0....2....2....0....2....2....2....0....0....2....2....2....0....2....0
%e ..2....0....0....2....0....0....2....2....2....2....2....0....2....0....2....2
%e ..2....0....2....0....2....0....2....0....0....0....0....0....0....2....2....0
%e ..2....2....0....0....2....3....1....1....2....1....1....0....0....2....0....2
%e ..0....3....1....1....2....2....0....0....2....0....0....1....2....0....1....3
%e ..0....1....1....0....0....0....0....0....1....0....3....1....0....0....1....0
%e ..1....0....3....3....0....1....0....1....0....0....2....0....1....1....1....0
%e ..3....1....1....2....1....0....1....1....0....1....1....1....0....0....1....1
%e ..1....0....2....2....2....1....2....2....0....3....1....3....3....3....3....1
%e ..0....3....0....0....2....3....3....1....1....1....0....1....2....1....0....1
%e ..2....1....0....0....3....1....2....2....2....2....0....1....2....3....0....0
%K nonn
%O 1,1
%A _R. H. Hardin_ Jun 12 2012