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.

A251434 Number of length 7+2 0..n arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.

Original entry on oeis.org

240, 9439, 127566, 938895, 4868362, 19285211, 64105154, 183394583, 471403286, 1102425601, 2401296076, 4893740761, 9479843984, 17499293961, 31078021378, 53193428735, 88367832130, 142559457359
Offset: 1

Views

Author

R. H. Hardin, Dec 02 2014

Keywords

Comments

Row 7 of A251428

Examples

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