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.

A252175 Number of length n+2 0..6 arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.

Original entry on oeis.org

7, 917, 2729, 39109, 277101, 2485637, 18231947, 135424961, 963247737, 6838373877, 48103629141, 337900112109, 2368821073603, 16597473994629, 116236940081089
Offset: 1

Views

Author

R. H. Hardin, Dec 15 2014

Keywords

Comments

Column 6 of A252177

Examples

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