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.

A250642 Number of length n+1 0..4 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, 65, 89, 1293, 4853, 34441, 163043, 915663, 4537317, 23671551, 118358549, 601565301, 3011330309, 15155615651, 75845220727, 380253505733, 1902264449049, 9522274036139, 47624961772074, 238244610944161, 1191402062810086
Offset: 1

Views

Author

R. H. Hardin, Nov 26 2014

Keywords

Comments

Column 4 of A250646

Examples

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