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.

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

1, 106, 134, 2954, 12473, 120114, 677505, 4749950, 28200435, 177863786, 1063874048, 6491819162, 38892883673, 234724691398, 1407192408230, 8460554956974, 50741165814612, 304671802762820, 1827631230875303
Offset: 1

Views

Author

R. H. Hardin, Nov 26 2014

Keywords

Comments

Column 5 of A250646

Examples

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