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

246, 5211, 93308, 1581686, 26242268, 430682205, 7023308036, 114062278982, 1847205725100, 29854017540652, 481755564098784, 7764949351300178, 125039067197089316, 2011992600375317822, 32354843213417739992

Offset: 1

Author

R. H. Hardin May 17 2012

Keywords

• nonn

Comments

Row 4 of A212471

Examples

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

Links

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