cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A212468 Number of 0..3 arrays of length n+9 with sum no more than 15 in any length 10 subsequence (=50% duty cycle).

Original entry on oeis.org

582440, 2034200, 7274268, 26242268, 95010466, 344305566, 1246724695, 4504766041, 16223101320, 58162431112, 207319630999, 740101423056, 2647902413670, 9488805055639, 34037887492235, 122166508976307
Offset: 1

Views

Author

R. H. Hardin May 17 2012

Keywords

Comments

Column 5 of A212471

Examples

			Some solutions for n=3
..2....0....0....2....2....2....0....0....2....2....0....2....0....2....0....2
..0....0....2....0....0....2....2....0....0....0....0....2....0....0....0....0
..0....0....0....2....0....2....2....0....0....0....2....0....0....0....0....2
..0....0....0....0....0....2....0....0....0....2....2....2....2....0....2....2
..0....2....0....2....2....0....0....0....0....2....2....0....0....2....0....0
..0....2....0....0....2....2....2....0....0....0....0....0....2....0....0....0
..0....0....2....0....2....2....2....2....0....2....0....0....2....0....2....0
..2....0....2....3....2....0....0....0....3....1....3....1....1....0....3....3
..3....3....2....2....1....1....2....2....3....0....0....3....2....3....0....1
..2....3....2....1....3....1....2....2....1....2....3....0....1....0....1....3
..2....3....3....2....1....1....0....2....3....1....0....1....2....2....1....0
..2....2....1....1....0....3....3....0....1....1....1....3....3....3....1....2