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.

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

Original entry on oeis.org

128, 3517, 32032, 195927, 810964, 2810751, 7989940, 20567199, 46931176, 100480363, 198506588, 375153177, 669200436, 1155420975, 1910171088, 3080038929, 4801129076, 7337318733, 10913397192, 15974820909, 22870564032
Offset: 1

Views

Author

R. H. Hardin, Nov 13 2014

Keywords

Comments

Row 7 of A250167

Examples

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