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.

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

Original entry on oeis.org

2699598, 7269626, 19976155, 55360211, 154089343, 429886243, 1200645159, 3354267511, 9367667604, 26139182862, 72841658426, 202630826716, 562443898300, 1557047060794, 4296908081691, 11867091374754, 32817710013245
Offset: 1

Views

Author

R. H. Hardin May 06 2012

Keywords

Comments

Column 7 of A212232

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