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.

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

Original entry on oeis.org

6, 48, 132, 872, 3496, 24888, 144624, 1019568, 6717892, 47046932, 329430764, 2322991876, 16258944216, 113059436760, 777944537312
Offset: 1

Views

Author

R. H. Hardin, Nov 14 2014

Keywords

Comments

Column 5 of A250229

Examples

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