A212236 Number of 0..2 arrays of length 3+2*n with sum no more than 2*n in any length 2n subsequence (=50% duty cycle).
70, 775, 7596, 71427, 660796, 6062948, 55360211, 503916387, 4577086146, 41509589394, 376014757137, 3403088304192, 30777595344747, 278194559997967, 2513387971773920, 22698724065174107, 204927838029912468
Offset: 1
Keywords
Examples
Some solutions for n=3 ..1....0....1....0....1....0....0....0....1....1....2....2....0....2....0....0 ..0....2....2....2....2....2....0....1....0....2....1....1....2....0....0....0 ..0....1....0....0....1....0....1....2....0....0....1....0....0....0....2....2 ..2....0....0....2....0....1....1....1....2....2....1....1....0....0....0....2 ..0....2....1....0....0....0....0....0....1....0....0....2....0....1....0....1 ..1....0....1....0....1....1....0....1....0....0....1....0....0....2....0....0 ..1....1....0....2....0....0....1....0....1....0....0....0....2....1....2....0 ..1....1....2....1....0....2....1....1....0....2....1....0....2....1....0....1 ..0....1....1....0....1....0....2....1....1....0....2....1....2....0....2....1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Comments