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.

A200458 Number of -n..n arrays x(0..5) of 6 elements with zero sum and nonzero first and second differences.

Original entry on oeis.org

10, 486, 3788, 16380, 50852, 127988, 278906, 547518, 991740, 1686602, 2726152, 4224676, 6319970, 9175294, 12980046, 17954222, 24348932, 32448240, 42572590, 55080404, 70369230, 88879322, 111095332, 137546940, 168813148, 205524308
Offset: 1

Views

Author

R. H. Hardin Nov 18 2011

Keywords

Comments

Row 4 of A200454

Examples

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

Formula

Empirical: a(n) = a(n-3) +a(n-4) +2*a(n-5) -2*a(n-8) -a(n-9) -2*a(n-10) -a(n-11) -a(n-12) +2*a(n-15) +2*a(n-16) +2*a(n-17) +2*a(n-18) -a(n-21) -a(n-22) -2*a(n-23) -a(n-24) -2*a(n-25) +2*a(n-28) +a(n-29) +a(n-30) -a(n-33)