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.

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

Original entry on oeis.org

7536790, 25829770, 91147915, 325333429, 1167362677, 4198162231, 15103463125, 54284048195, 194700970891, 696196564935, 2479358418705, 8785103222513, 30936275166758, 109148631741555, 386157614218688, 1369098248146214
Offset: 1

Views

Author

R. H. Hardin Jun 12 2012

Keywords

Comments

Column 6 of A213464

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
..0....0....2....0....2....2....0....0....0....2....0....2....0....0....0....2
..2....0....2....0....0....2....2....2....0....0....2....0....0....2....0....0
..0....0....0....2....2....0....0....0....2....0....0....0....2....0....2....0
..2....0....0....2....2....0....0....0....2....2....0....0....2....2....2....2
..0....2....0....2....2....0....0....0....0....0....0....0....2....0....2....0
..0....0....0....2....0....0....0....0....0....0....0....2....0....0....2....0
..0....2....2....0....0....0....2....0....0....0....2....2....2....0....2....0
..3....2....1....0....0....3....1....2....2....0....1....1....0....3....3....2
..1....1....1....2....0....3....1....3....0....3....3....3....0....3....0....3
..0....3....2....3....3....0....3....2....0....2....0....3....1....1....2....2
..1....1....0....1....0....3....2....0....3....0....1....3....0....2....1....3
..0....0....3....0....0....3....3....3....3....1....3....1....3....0....1....1