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.

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

61, 725, 5097, 44465, 349257, 2647405, 19285211, 137949185, 976032575, 6871688649, 48247321093, 338304918133, 2370405542621, 16602202832585, 116254396792509, 813946050011849, 5698326553998227, 39891307203318801
Offset: 1

Views

Author

R. H. Hardin, Dec 02 2014

Keywords

Comments

Column 6 of A251428

Examples

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