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.

A250651 Number of length 7+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

120, 2870, 28238, 163043, 677505, 2225195, 6290716, 15474251, 34620063, 71045837, 136895633, 249167782, 432945014, 721867127, 1163471851, 1819556318, 2767225673, 4114863787, 5983678292, 8546815362, 11983543443, 16566644515
Offset: 1

Views

Author

R. H. Hardin, Nov 26 2014

Keywords

Comments

Row 7 of A250646

Examples

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