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.

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

9, 65, 205, 1351, 5982, 34415, 169352, 904695, 4547008, 23448029, 117953499, 598260521, 3002881031, 15113176921, 75724031785, 379750748041, 1900758538693, 9516621521809, 47607635835257, 238183334181909, 1191212059701364
Offset: 1

Views

Author

R. H. Hardin, Nov 22 2014

Keywords

Comments

Column 4 of A250419

Examples

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