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.

A212469 Number of 0..3 arrays of length n+11 with sum no more than 18 in any length 12 subsequence (=50% duty cycle).

Original entry on oeis.org

9240426, 32644314, 118029501, 430682205, 1578372444, 5795798788, 21292987433, 78186208521, 286703599009, 1049119428341, 3828209603876, 13919545400124, 50392127733527, 182633247168566, 663071942478215, 2410713609407184
Offset: 1

Views

Author

R. H. Hardin May 17 2012

Keywords

Comments

Column 6 of A212471

Examples

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