login

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”).

A213466
Number of 0..3 arrays of length 2*n+1 with sum less than 3*n in any length 2n subsequence (=less than 50% duty cycle)
1
14, 310, 5542, 94238, 1568984, 25829770, 422335348, 6874493982, 111547175144, 1805837931800, 29183975631910, 471002809679314, 7593394526409992, 122312334606560252, 1968761313647420552, 31670562474748858142
OFFSET
1,1
COMMENTS
Row 2 of A213464
LINKS
EXAMPLE
Some solutions for n=3
..3....0....3....0....2....0....1....0....1....1....3....0....0....2....1....1
..1....0....1....0....1....0....2....2....2....1....1....0....3....3....1....0
..1....0....0....2....0....1....0....3....1....1....0....1....3....0....2....2
..0....3....0....1....0....1....2....0....0....2....1....1....1....0....0....1
..0....1....1....1....3....1....2....1....2....3....0....1....1....2....1....0
..3....0....0....2....1....1....0....0....0....0....1....0....0....1....0....1
..0....3....2....2....1....0....2....1....0....1....1....1....0....1....3....0
CROSSREFS
Sequence in context: A034912 A372350 A250966 * A303488 A341501 A255857
KEYWORD
nonn
AUTHOR
R. H. Hardin Jun 12 2012
STATUS
approved