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.

A249207 Number of length n+6 0..3 arrays with no seven consecutive terms having five times the sum of any two elements equal to two times the sum of the remaining five.

Original entry on oeis.org

14336, 51200, 183516, 658448, 2363528, 8486156, 30475714, 109474166, 393232196, 1412652056, 5075187032, 18233890510, 65510631030, 235369064306, 845649181758, 3038313571704, 10916323664982, 39221255161200, 140918266479766
Offset: 1

Views

Author

R. H. Hardin, Oct 23 2014

Keywords

Comments

Column 3 of A249212

Examples

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