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.

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

Original entry on oeis.org

5, 33, 89, 473, 1785, 9437, 47953, 264473, 1440243, 8079297, 45802695, 261075913, 1482800313, 8373051893, 46955800797, 260855334021, 1431746806913, 7751019623085, 41366541154615
Offset: 1

Views

Author

R. H. Hardin, Nov 14 2014

Keywords

Comments

Column 4 of A250229

Examples

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