A213467 Number of 0..3 arrays of length 2*n+2 with sum less than 3*n in any length 2n subsequence (=less than 50% duty cycle).

31, 927, 18018, 319078, 5444644, 91147915, 1508740928, 24791568796, 405322707108, 6602565936460, 107259549395070, 1738767957760734, 28139860212492988, 454796793295838938, 7342320714558321488

Offset: 1

Author

R. H. Hardin Jun 12 2012

Keywords

• nonn

Comments

Row 3 of A213464

Examples

			Some solutions for n=3
..3....2....1....1....3....0....0....1....0....1....3....0....1....0....3....2
..0....0....1....0....0....2....0....3....1....2....0....0....0....0....1....1
..0....1....0....0....0....0....2....0....0....2....1....2....1....0....1....2
..1....2....1....0....1....2....0....0....3....1....0....2....0....1....0....0
..0....0....0....1....2....0....2....3....0....1....1....3....1....0....2....2
..3....2....1....0....1....0....0....0....2....0....3....0....3....1....0....0
..1....1....1....2....2....2....2....0....1....1....0....0....2....2....0....2
..1....1....0....3....2....1....0....1....0....3....2....1....0....1....0....0
		

Links

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