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.

A212830 Number of 0..n arrays of length n+1 with no adjacent pair equal to its immediately preceding adjacent pair, and new values introduced in 0..n order.

Original entry on oeis.org

2, 5, 13, 44, 168, 717, 3360, 17092, 93538, 546873, 3396379, 22300885, 154193327, 1118804486, 8493592723, 67288261914, 554996479921, 4756036642107, 42266543239132, 388879705390976, 3698606881082199, 36312877059583874
Offset: 1

Views

Author

R. H. Hardin May 28 2012

Keywords

Comments

Subdiagonal 1 of A212829

Examples

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