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

14, 310, 5542, 94238, 1568984, 25829770, 422335348, 6874493982, 111547175144, 1805837931800, 29183975631910, 471002809679314, 7593394526409992, 122312334606560252, 1968761313647420552, 31670562474748858142

Offset: 1

Author

R. H. Hardin Jun 12 2012

Keywords

• nonn

Comments

Row 2 of A213464

Examples

			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
		

Links

• R. H. Hardin, Table of n, a(n) for n = 1..210