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.

A250650 Number of length 6+1 0..n arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.

Original entry on oeis.org

72, 1061, 7696, 34441, 120114, 332827, 812004, 1749359, 3497934, 6469165, 11395070, 19047473, 30746306, 47793245, 72401338, 106583429, 153809996, 217072541, 301491734, 411350415, 553983224, 735181841, 965180792, 1251735269
Offset: 1

Views

Author

R. H. Hardin, Nov 26 2014

Keywords

Comments

Row 6 of A250646

Examples

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