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.

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

15, 232, 927, 11906, 84094, 845358, 6847916, 60473968, 493271080, 4110606460, 33227112639, 270174922792, 2170847791630, 17476736034672, 140045328565480, 1123079823815258, 8990031255733660, 71987420633900826, 576024775450468215
Offset: 1

Views

Author

R. H. Hardin, Nov 22 2014

Keywords

Comments

Column 7 of A250419

Examples

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