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.

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

13, 161, 606, 6433, 39916, 341011, 2399000, 18334295, 130350889, 947356115, 6693133584, 47588393713, 334543874696, 2356688545513, 16526137384381, 115977271626785, 812415242570854, 5692700008978435, 39860063264311589
Offset: 1

Views

Author

R. H. Hardin, Nov 22 2014

Keywords

Comments

Column 6 of A250419

Examples

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