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.

A213460 Number of 0..3 arrays of length n+7 with sum less than 12 in any length 6 subsequence (=less than 50% duty cycle).

Original entry on oeis.org

28722, 94238, 319078, 1091036, 3737885, 12773955, 43399990, 146145812, 486196569, 1623648129, 5447568893, 18331034879, 61772986963, 208242996467, 701740238736, 2362743601059, 7947716942734, 26723699565529, 89867277897553
Offset: 1

Views

Author

R. H. Hardin Jun 12 2012

Keywords

Comments

Column 4 of A213464

Examples

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