A213468 Number of 0..3 arrays of length 2*n+3 with sum less than 3*n in any length 2n subsequence (=less than 50% duty cycle).
70, 2735, 58898, 1091036, 19105020, 325333429, 5451265872, 90406374528, 1488870622780, 24396922947484, 398282413965566, 6483402596528564, 105301980143117156, 1707201970861977822, 27637076220888829232
Offset: 1
Keywords
Examples
Some solutions for n=3 ..0....2....2....1....0....2....0....0....3....1....1....0....0....0....1....3 ..2....3....2....0....0....0....2....2....1....2....3....0....2....2....3....1 ..1....1....0....3....2....1....1....1....1....3....0....0....0....2....3....0 ..0....2....0....0....0....2....2....2....0....0....1....2....0....0....0....0 ..0....0....0....0....0....1....0....0....0....0....1....1....0....0....1....2 ..2....0....3....3....0....0....0....2....3....1....2....0....3....2....0....0 ..3....0....0....0....1....0....1....1....0....0....1....0....2....1....1....1 ..1....3....0....1....2....2....3....2....3....0....0....1....0....3....0....0 ..1....0....2....1....3....2....2....1....2....3....0....1....2....2....3....3
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Comments