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.

A250416 Number of length n+1 0..5 arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.

Original entry on oeis.org

11, 106, 370, 3154, 16790, 119364, 713260, 4620694, 28033122, 174036890, 1052524169, 6409923762, 38618278972, 233193985046, 1401840843777, 8433815453844, 50645668891739, 304220519953548, 1825994803261130
Offset: 1

Views

Author

R. H. Hardin, Nov 22 2014

Keywords

Comments

Column 5 of A250419

Examples

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