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.

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

Original entry on oeis.org

70, 775, 7596, 71427, 660796, 6062948, 55360211, 503916387, 4577086146, 41509589394, 376014757137, 3403088304192, 30777595344747, 278194559997967, 2513387971773920, 22698724065174107, 204927838029912468
Offset: 1

Views

Author

R. H. Hardin May 06 2012

Keywords

Comments

Row 4 of A212232

Examples

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