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.

A242467 Number of length n+2 0..n arrays with no three equal elements in a row and new values 0..n introduced in 0..n order.

Original entry on oeis.org

3, 11, 40, 158, 684, 3232, 16533, 90862, 533013, 3319374, 21844874, 151329961, 1099822975, 8361244270, 66320787389, 547602710173, 4697109624463, 41777867546600, 384671271459042, 3661037447467530, 35965775221739498
Offset: 1

Views

Author

R. H. Hardin, May 15 2014

Keywords

Comments

Diagonal of A242472.

Examples

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

Crossrefs

Cf. A242472.