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.

A212477 Number of 0..3 arrays of length 2*n+5 with sum no more than 3*n in any length 2n subsequence (=50% duty cycle).

Original entry on oeis.org

2037, 53553, 1098260, 19960518, 344305566, 5795798788, 96239314549, 1584499716270, 25938577854660, 422900154613448, 6874291237701437, 111487268294929274, 1804868382278013414, 29177249831017201248
Offset: 1

Views

Author

R. H. Hardin May 17 2012

Keywords

Comments

Row 6 of A212471

Examples

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