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.

A200558 Number of -n..n arrays x(0..7) of 8 elements with zero sum and nonzero second differences.

Original entry on oeis.org

362, 21626, 266812, 1689732, 7286542, 24378976, 68263780, 167521092, 371147726, 758120242, 1449515972, 2623194882, 4532144132, 7526204850, 12076969112, 18807807576, 28527996642, 42270457652, 61336410730, 87344689150
Offset: 1

Views

Author

R. H. Hardin Nov 19 2011

Keywords

Comments

Row 6 of A200553

Examples

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

Links

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.