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.

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

Original entry on oeis.org

435, 1113, 2902, 7596, 19834, 51440, 131950, 339564, 876777, 2267261, 5864274, 15159987, 39161060, 101136977, 261240954, 674934552, 1743897567, 4505828919, 11641402990, 30075908053, 77701600604, 200746256554, 518645274018
Offset: 1

Views

Author

R. H. Hardin May 06 2012

Keywords

Comments

Column 3 of A212232

Examples

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