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.

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

80, 1128, 9120, 94452, 863840, 7658288, 64105154, 526064608, 4251906158, 34199112972, 274205462432, 2196305116240, 17580163235182, 140685755592632
Offset: 1

Views

Author

R. H. Hardin, Dec 02 2014

Keywords

Comments

Column 7 of A251428

Examples

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