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.

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

8, 1464, 4680, 79672, 654644, 6994984, 59838132, 513937352, 4190189694, 34020988396, 273415166334, 2193948803940
Offset: 1

Views

Author

R. H. Hardin, Dec 15 2014

Keywords

Comments

Column 7 of A252177

Examples

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