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

10, 150, 2338, 36814, 582440, 9240426, 146861788, 2337014158, 37222215640, 593246686360, 9460081927746, 150915638082466, 2408347433725048, 38443582673708348, 613802451466325528, 9802073528030277518

Offset: 1

Author

R. H. Hardin May 17 2012

Keywords

• nonn

Comments

Row 1 of A212471

Examples

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

Links

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