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.

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

Original entry on oeis.org

6, 48, 140, 1132, 6732, 51884, 381812, 2783500, 19762916, 135821156, 901633552, 5803821376, 36474619144, 225357234996, 1376605005684, 8348102460156
Offset: 1

Views

Author

R. H. Hardin, Nov 16 2014

Keywords

Comments

Column 5 of A250277

Examples

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