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.

A249191 Number of length n+6 0..2 arrays with no seven consecutive terms having four times the sum of any three elements equal to three times the sum of the remaining four.

Original entry on oeis.org

1792, 4586, 11874, 30876, 80354, 208876, 541624, 1400008, 3618986, 9363890, 24245852, 62802512, 162682626, 421350312, 1091065338, 2824952300, 7314373948, 18939413676, 49042889408, 126997380012, 328860987784, 851576753420
Offset: 1

Views

Author

R. H. Hardin, Oct 23 2014

Keywords

Comments

Column 2 of A249197

Examples

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