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.

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

56, 957, 6820, 30315, 100894, 277101, 654644, 1397115, 2729346, 5000775, 8646710, 14320677, 22753218, 35050107, 52358558, 76391397, 108844088, 152265601, 208998994, 282689603, 376505412, 495411841, 643581780, 827671511, 1052928232
Offset: 1

Views

Author

R. H. Hardin, Dec 15 2014

Keywords

Comments

Row 5 of A252177

Examples

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