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.

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

Original entry on oeis.org

8, 88, 288, 3156, 25964, 281552, 2908232, 30143732, 301550620, 2901853512, 26702134812, 235590646376
Offset: 1

Views

Author

R. H. Hardin, Nov 16 2014

Keywords

Comments

Column 7 of A250277

Examples

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