A213469
Number of 0..3 arrays of length 2*n+4 with sum less than 3*n in any length 2n subsequence (=less than 50% duty cycle).
Original entry on oeis.org
157, 7803, 191573, 3737885, 67329406, 1167362677, 19808276303, 331605526490, 5501075085468, 90671574326172, 1487390263956378, 24310876230706073, 396224883822318038, 6443121835406288422, 104579933906413425698
Offset: 1
Some solutions for n=3
..0....0....2....2....2....0....0....0....0....0....2....0....0....0....0....0
..2....1....1....0....0....0....0....0....1....0....2....1....3....2....3....0
..3....1....3....2....1....2....0....1....0....3....1....2....1....0....1....1
..1....3....0....0....0....0....3....0....0....2....0....2....0....2....0....1
..0....0....0....0....0....1....2....1....1....0....1....0....1....1....0....0
..1....0....0....1....3....1....0....0....0....2....0....0....2....0....1....1
..1....0....2....1....1....0....0....2....1....1....0....1....0....2....1....1
..1....2....1....3....0....1....0....2....1....0....0....2....0....1....0....0
..2....0....1....2....0....2....0....0....3....0....0....0....2....0....0....1
..1....3....1....0....0....3....1....2....0....3....0....2....2....0....0....0
A213470
Number of 0..3 arrays of length 2*n+5 with sum less than 3*n in any length 2n subsequence (=less than 50% duty cycle).
Original entry on oeis.org
353, 22506, 615561, 12773955, 237475982, 4198162231, 72188618371, 1220298706370, 20395481622380, 338170996357600, 5574396540683306, 91481580201645051, 1496133943774251078, 24401386122053197406, 397092484505964837242, 6450193163022177761972, 104613879499273682174696
Offset: 1
Some solutions for n=3:
..2....0....2....2....0....2....2....2....0....0....2....2....2....0....2....0
..2....0....0....2....0....0....2....2....2....2....2....0....2....0....2....2
..2....0....2....0....2....0....2....0....0....0....0....0....0....2....2....0
..2....2....0....0....2....3....1....1....2....1....1....0....0....2....0....2
..0....3....1....1....2....2....0....0....2....0....0....1....2....0....1....3
..0....1....1....0....0....0....0....0....1....0....3....1....0....0....1....0
..1....0....3....3....0....1....0....1....0....0....2....0....1....1....1....0
..3....1....1....2....1....0....1....1....0....1....1....1....0....0....1....1
..1....0....2....2....2....1....2....2....0....3....1....3....3....3....3....1
..0....3....0....0....2....3....3....1....1....1....0....1....2....1....0....1
..2....1....0....0....3....1....2....2....2....2....0....1....2....3....0....0
A213471
Number of 0..3 arrays of length 2*n+6 with sum less than 3*n in any length 2n subsequence (=less than 50% duty cycle).
Original entry on oeis.org
793, 65425, 1940673, 43399990, 836356119, 15103463125, 263422708979, 4498700185621, 75773483221458, 1264058518607488, 20939915070874170, 345057032966423355, 5662807472785412683, 92633089841621699568
Offset: 1
Some solutions for n=3
..0....0....2....2....2....0....0....0....0....0....2....2....0....0....2....0
..0....0....0....0....2....2....0....0....2....0....0....2....2....0....0....0
..0....2....0....2....0....2....0....0....0....2....0....2....2....0....2....2
..0....2....0....2....0....2....0....2....2....0....2....2....0....2....0....0
..2....0....2....0....2....0....2....2....0....0....2....0....0....0....0....0
..3....1....1....0....0....1....0....0....1....2....0....0....0....1....0....0
..2....0....0....0....3....0....3....0....0....2....2....2....0....1....1....2
..0....0....0....3....0....1....3....1....2....0....0....1....2....1....0....2
..0....0....0....0....1....0....0....0....1....2....0....2....0....1....1....0
..0....1....2....2....1....3....0....0....0....0....2....0....3....2....2....0
..0....1....1....1....0....2....2....2....2....0....2....3....2....0....3....1
..1....1....0....2....3....0....0....1....1....3....0....0....0....3....0....0
Comments