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.

A250165 Number of length n+1 0..6 arrays with the sum of adjacent differences multiplied by some arrangement of +-1 equal to zero.

Original entry on oeis.org

7, 67, 639, 5831, 49037, 380939, 2810751, 20169871, 142786013, 1004527983, 7047533399, 49383700439, 345855478109, 2421574390899, 16953120700735, 118679602696751, 830786561364589, 5815618832245175, 40709771502502967
Offset: 1

Views

Author

R. H. Hardin, Nov 13 2014

Keywords

Comments

Column 6 of A250167

Examples

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