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.

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

Original entry on oeis.org

5, 33, 89, 581, 2909, 17885, 107387, 636197, 3664311, 20397261, 110088763, 579849133, 3000181901, 15332918889, 77721061539, 391879647949, 1969334263587, 9876322139993, 49468980310981, 247600089386801, 1238741942676679
Offset: 1

Views

Author

R. H. Hardin, Nov 16 2014

Keywords

Comments

Column 4 of A250277

Examples

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