A212237
Number of 0..2 arrays of length 4+2*n with sum no more than 2*n in any length 2n subsequence (=50% duty cycle).
Original entry on oeis.org
157, 1895, 19834, 191853, 1804448, 16740414, 154089343, 1411275807, 12881812440, 117296944044, 1066131740757, 9676805664696, 87736143094569, 794774081112347, 7194441026799642, 65086616352089797, 588530376516453384
Offset: 1
Some solutions for n=3
..2....0....0....1....0....0....1....0....1....2....1....2....1....0....0....2
..0....0....2....1....1....1....2....2....1....1....0....0....1....2....1....0
..1....1....2....0....2....0....1....0....1....0....1....1....0....0....0....0
..0....1....1....2....0....1....1....2....0....1....2....0....1....0....1....1
..2....0....0....0....1....2....0....0....1....0....0....0....2....2....1....0
..1....1....0....1....0....0....0....1....0....0....1....1....1....1....0....1
..0....2....1....1....1....0....1....1....0....0....1....2....1....0....1....2
..0....1....0....0....0....1....0....0....1....2....0....0....0....0....0....0
..0....0....1....2....2....1....1....0....0....0....2....1....0....2....0....2
..0....0....0....0....0....0....0....2....2....2....2....2....1....1....2....1
A212238
Number of 0..2 arrays of length 5+2*n with sum no more than 2*n in any length 2n subsequence (=50% duty cycle).
Original entry on oeis.org
353, 4663, 51440, 514687, 4931630, 46305966, 429886243, 3962696059, 36354382954, 332393767866, 3031533285381, 27595759169532, 250826014161861, 2277103688384513, 20652344756363304, 187156724402029627, 1694914205955775462, 15340549508692418292, 138778053213558014181
Offset: 1
Some solutions for n=3:
..1....2....0....0....1....1....1....2....1....2....0....2....1....2....1....1
..1....0....2....1....0....0....1....0....2....1....0....0....1....2....0....2
..0....0....0....0....2....1....1....0....0....1....1....1....1....1....2....1
..0....0....1....1....0....1....0....0....0....0....2....1....0....0....1....0
..1....0....0....1....2....1....2....1....0....2....0....0....0....0....0....1
..1....0....2....0....0....1....1....0....2....0....0....0....0....0....0....1
..0....0....0....0....0....0....0....2....0....0....0....1....2....0....0....1
..0....0....2....2....0....1....0....2....0....1....1....1....0....1....2....1
..1....0....0....0....0....1....1....1....1....2....0....0....1....2....1....0
..0....2....2....2....0....1....2....0....0....1....1....1....1....2....0....0
..1....2....0....2....0....0....0....1....1....0....1....2....1....0....2....0
A212239
Number of 0..2 arrays of length 6+2*n with sum no more than 2*n in any length 2n subsequence (=50% duty cycle).
Original entry on oeis.org
793, 11518, 131950, 1376128, 13468524, 128148456, 1200645159, 11143104246, 102770036310, 943639250739, 8636456931969, 78848824010001, 718489851092745, 6537040547889223, 59402114237433426, 539234176052230974
Offset: 1
Some solutions for n=3
..1....0....2....1....1....1....0....0....1....0....1....0....0....1....1....1
..0....1....0....0....0....2....0....2....1....0....1....0....0....1....0....2
..2....1....0....0....2....0....0....2....0....0....0....2....1....2....0....0
..0....0....0....0....1....2....1....0....0....1....1....1....2....0....0....2
..1....0....0....0....1....1....2....1....1....0....2....2....1....2....1....0
..1....1....0....0....1....0....1....0....0....2....0....1....0....0....0....1
..2....0....0....0....0....1....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....1....0....0....2....2....0....2....0....0....0....1....1
..1....0....1....2....1....0....2....0....0....0....0....2....0....1....0....1
..0....1....0....0....1....1....1....0....0....2....1....0....0....1....2....1
..0....1....1....2....1....0....1....2....0....1....1....1....2....1....1....2
..0....0....1....1....0....2....1....0....1....0....1....2....0....0....2....0
Comments