Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 May 25 2012 20:44:01
%S 228826,587036,1549297,4135249,11095332,29835132,80249504,215618862,
%T 578057915,1544727475,4110474108,10880175644,28614540955,75408015307,
%U 199314711575,528018279894,1400996454870,3720982545277,9888213327269
%N Number of 0..2 arrays of length n+11 with sum less than 12 in any length 12 subsequence (=less than 50% duty cycle)
%C Column 6 of A212729
%H R. H. Hardin, <a href="/A212727/b212727.txt">Table of n, a(n) for n = 1..130</a>
%e Some solutions for n=3
%e ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
%e ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
%e ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
%e ..1....0....0....0....0....1....1....1....2....0....1....0....1....1....0....0
%e ..0....2....0....2....0....1....1....0....0....1....0....0....1....0....2....1
%e ..1....0....2....0....1....2....2....2....0....2....0....0....1....0....1....0
%e ..0....0....1....2....0....2....0....0....2....2....2....2....0....0....1....0
%e ..0....1....1....0....0....0....1....1....1....1....1....0....1....0....0....0
%e ..1....2....2....1....2....0....2....1....0....0....2....0....1....1....2....2
%e ..0....0....0....1....1....1....0....0....0....0....0....2....0....2....0....2
%e ..1....0....2....0....2....1....0....0....1....0....2....0....1....0....0....1
%e ..2....1....1....1....0....1....0....1....1....1....0....1....0....1....0....2
%e ..1....1....0....2....0....1....0....2....0....1....2....2....2....1....2....0
%e ..2....0....2....1....0....1....2....2....2....2....0....0....2....2....0....0
%K nonn
%O 1,1
%A _R. H. Hardin_ May 25 2012