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.

A206617 Number of (n+1)X5 0..2 arrays with every 2X3 or 3X2 subblock having no more than two equal edges, and new values 0..2 introduced in row major order.

Original entry on oeis.org

4035, 270869, 21744156, 1719525751, 135010973857, 10633148505553, 837071761231340, 65890955765683798, 5187056339251009089, 408327809631129343522, 32143691853804370071056, 2530367382763227289642909
Offset: 1

Views

Author

R. H. Hardin Feb 10 2012

Keywords

Comments

Column 4 of A206621

Examples

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