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.

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

6, 536, 1428, 17092, 100894, 753200, 4652710, 29364176, 177955614, 1080135428, 6499878776, 39104150100, 234816782208, 1409805025568, 8460732943882, 50772490924064, 304654183120186, 1828001400070884, 10968208935015636
Offset: 1

Views

Author

R. H. Hardin, Dec 15 2014

Keywords

Comments

Column 5 of A252177

Examples

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