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.

A249533 Number of length 3+5 0..n arrays with no six consecutive terms having five times any element equal to the sum of the remaining five.

Original entry on oeis.org

240, 4120, 42400, 263156, 1154444, 4116620, 12297972, 32313804, 76590192, 167150680, 340541012, 655325864, 1200479148, 2107926892, 3567580824, 5846311812, 9310701480, 14457811924, 21942849820, 32624138612, 47607833428
Offset: 1

Views

Author

R. H. Hardin, Oct 31 2014

Keywords

Comments

Row 3 of A249530

Examples

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