A212476
Number of 0..3 arrays of length 2*n+4 with sum no more than 3*n in any length 2n subsequence (=50% duty cycle).
Original entry on oeis.org
707, 16649, 321320, 5622580, 95010466, 1578372444, 25966120647, 424537002094, 6911873593516, 112193588288892, 1817051683302947, 29377851622547612, 474335448720482746, 7650319463541214660, 123278749437509026298
Offset: 1
Some solutions for n=3
..2....0....2....2....0....0....0....0....2....0....2....2....0....2....0....0
..0....2....0....2....2....2....0....2....0....0....0....2....0....2....0....2
..0....3....1....3....3....2....3....3....2....2....3....0....1....1....0....2
..3....3....3....2....1....3....1....0....0....2....2....2....2....1....3....0
..1....0....0....0....0....0....2....1....0....2....0....3....2....0....1....0
..0....0....0....0....0....0....0....1....1....1....0....0....3....0....1....1
..0....0....1....0....2....1....0....0....2....0....1....0....0....0....1....1
..0....3....3....2....1....2....3....3....0....0....2....0....1....2....3....3
..0....2....1....2....1....3....1....2....0....0....2....3....1....2....0....3
..1....1....1....3....3....0....3....2....1....0....1....3....1....1....1....0
A212477
Number of 0..3 arrays of length 2*n+5 with sum no more than 3*n in any length 2n subsequence (=50% duty cycle).
Original entry on oeis.org
2037, 53553, 1098260, 19960518, 344305566, 5795798788, 96239314549, 1584499716270, 25938577854660, 422900154613448, 6874291237701437, 111487268294929274, 1804868382278013414, 29177249831017201248
Offset: 1
Some solutions for n=3
..2....0....2....0....2....0....0....2....2....2....2....0....0....0....2....0
..2....2....0....2....0....0....0....0....0....0....0....0....0....2....0....0
..0....0....0....2....0....2....0....0....0....2....0....0....2....2....0....2
..0....2....2....2....2....0....2....2....0....0....2....2....0....2....2....2
..1....1....0....3....2....1....1....3....0....3....2....2....3....1....1....0
..2....1....2....0....1....1....2....2....0....0....0....0....0....0....3....0
..2....2....0....0....2....2....1....0....1....0....2....1....0....0....1....1
..2....1....2....2....0....1....0....2....1....1....1....3....2....3....0....1
..0....1....1....1....0....1....2....0....2....1....0....0....3....1....2....0
..2....1....1....2....3....3....0....0....2....1....2....1....1....2....0....0
..1....3....2....1....2....1....1....1....0....1....0....1....3....2....1....3
A212478
Number of 0..3 arrays of length 2*n+6 with sum no more than 3*n in any length 2n subsequence (=50% duty cycle).
Original entry on oeis.org
5864, 172980, 3708268, 70600212, 1246724695, 21292987433, 357117150362, 5923063781205, 97514964737576, 1597131825489558, 26058934302628094, 423954039651724411, 6881835973423757103, 111509561797692820078
Offset: 1
Some solutions for n=3
..0....2....2....0....2....0....0....2....0....0....0....0....0....0....2....2
..2....0....2....2....2....2....0....0....0....2....0....2....0....0....2....2
..0....2....0....0....0....2....0....0....2....0....0....2....2....2....0....0
..0....2....0....0....2....0....0....2....2....0....2....0....0....0....2....0
..2....2....0....2....0....0....0....0....2....0....2....2....0....2....2....2
..0....0....0....0....2....2....0....0....0....0....0....2....0....0....0....2
..0....2....0....0....0....0....2....0....0....3....0....0....1....1....2....0
..0....0....3....0....3....0....0....3....1....2....2....1....1....3....2....2
..3....1....3....3....2....3....0....1....0....0....2....0....3....0....1....0
..1....2....2....1....0....1....0....2....0....1....0....2....2....2....1....3
..3....2....0....1....0....1....0....0....3....0....0....2....0....1....1....0
..2....2....0....2....3....1....3....1....0....0....2....3....0....1....2....3
Comments