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.

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

Original entry on oeis.org

4, 20, 52, 208, 704, 2720, 10952, 45888, 195516, 852260, 3760588, 16656832, 73584076, 323148964, 1409241264, 6099051768, 26171960056, 111250573364, 468230400620, 1951667338228, 8063089066756, 33057662096520, 134680763671240
Offset: 1

Views

Author

R. H. Hardin, Nov 14 2014

Keywords

Comments

Column 3 of A250229.

Examples

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

Crossrefs

Cf. A250229.