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.

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

Original entry on oeis.org

7, 67, 207, 1991, 14003, 130335, 1154141, 10172515, 86975297, 715749943, 5655832367, 43083514447, 318775210489, 2309920909887
Offset: 1

Views

Author

R. H. Hardin, Nov 16 2014

Keywords

Comments

Column 6 of A250277

Examples

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