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.

A212467 Number of 0..3 arrays of length n+7 with sum no more than 12 in any length 8 subsequence (=50% duty cycle).

Original entry on oeis.org

36814, 126606, 445780, 1581686, 5622580, 19960518, 70600212, 248263590, 865983608, 3027296124, 10612842491, 37272366925, 131018316920, 460663150544, 1619367566685, 5689883208343, 19982014129382, 70158722229804
Offset: 1

Views

Author

R. H. Hardin May 17 2012

Keywords

Comments

Column 4 of A212471

Examples

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