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.

A249006 Number of length 5+4 0..n arrays with no five consecutive terms having two times the sum of any three elements equal to three times the sum of the remaining two.

Original entry on oeis.org

416, 6872, 91888, 706704, 4149708, 16909524, 61034658, 179220600, 484680810, 1179584718, 2691862296, 5660060962, 11419487998, 21680491596, 39877845854, 70202009284, 120203803140, 198769546216, 321758154748, 506644858160
Offset: 1

Views

Author

R. H. Hardin, Oct 18 2014

Keywords

Comments

Row 5 of A249001

Examples

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