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.

A251433 Number of length 6+2 0..n arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.

Original entry on oeis.org

144, 3129, 31980, 183341, 791668, 2647405, 7658288, 19250197, 44217384, 93009121, 184267580, 343160689, 612192168, 1044502461, 1724282192, 2751658457, 4280852084, 6482911469, 9619637248, 13971461273, 19950718732
Offset: 1

Views

Author

R. H. Hardin, Dec 02 2014

Keywords

Comments

Row 6 of A251428

Examples

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