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.

A207986 Number of nX5 0..2 arrays avoiding the pattern z z+1 z horizontally and z z-1 z vertically.

Original entry on oeis.org

191, 36481, 4827482, 622569385, 81269646503, 10629041648848, 1389619561706920, 181656690367717549, 23747206634938949550, 3104389538995895621609, 405825684024902268661064, 53052111709600970085125290
Offset: 1

Views

Author

R. H. Hardin Feb 22 2012

Keywords

Comments

Column 5 of A207989

Examples

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