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.

A241961 Number of length n+3 0..5 arrays with no consecutive four elements summing to more than 2*5.

Original entry on oeis.org

721, 3437, 16660, 80132, 376559, 1782453, 8476317, 40313706, 191370192, 908268343, 4312922647, 20483132941, 97267496309, 461856616822, 2193101268453, 10414092378458, 49451882143389, 234822848509532, 1115058584108581
Offset: 1

Views

Author

R. H. Hardin, May 03 2014

Keywords

Comments

Column 5 of A241964.

Examples

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

Crossrefs

Cf. A241964.