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.

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

Original entry on oeis.org

1758, 5542, 18018, 58898, 191573, 615561, 1940673, 6155514, 19647614, 62899953, 201473363, 644672930, 2059300887, 6574540879, 20997506212, 67093545303, 214438467736, 685364105241, 2190180322534, 6998231709363, 22360737339084
Offset: 1

Views

Author

R. H. Hardin Jun 12 2012

Keywords

Comments

Column 3 of A213464

Examples

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