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.

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

Original entry on oeis.org

8, 88, 248, 2392, 10640, 120412, 838604, 8983896, 78435176, 789142896, 7558414812, 74218486628
Offset: 1

Views

Author

R. H. Hardin, Nov 14 2014

Keywords

Comments

Column 7 of A250229.

Examples

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

Crossrefs

Cf. A250229.