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.

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

29, 237, 1113, 6589, 34893, 183341, 938895, 4771117, 24063611, 120999825, 606973965, 3041165657, 15225030583, 76186376289, 381124730885, 1906242140613, 9533185117349, 47672275138133, 238381757180439, 1191974407973189
Offset: 1

Views

Author

R. H. Hardin, Dec 02 2014

Keywords

Comments

Column 4 of A251428

Examples

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