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.

A251425 Number of length n+2 0..5 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

42, 432, 2532, 18952, 122452, 791668, 4868362, 29782800, 179832500, 1084104408, 6515269116, 39138627524, 234937479552, 1410085029812, 8461645099972, 50774656443080, 304660870764438, 1828017536543716, 10968256803665504
Offset: 1

Views

Author

R. H. Hardin, Dec 02 2014

Keywords

Comments

Column 5 of A251428

Examples

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