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.

A186557 Number of (n+1)X5 0..3 arrays with no 2X2 subblock commuting with any of its horizontal and vertical 2X2 subblock neighbors.

Original entry on oeis.org

927477, 783375343, 663296784123, 561714653720250, 475681559860717916, 402827283017904807331, 341131017852900112413067, 288884064380556803805427879, 244639147969972250796140260427
Offset: 1

Views

Author

R. H. Hardin Feb 23 2011

Keywords

Comments

Column 4 of A186558

Examples

			Some solutions for 3X5
..0..0..0..0..1....0..0..0..2..3....2..0..3..2..3....2..0..3..2..1
..2..0..2..0..0....2..0..2..0..3....2..0..2..0..3....2..0..2..3..2
..0..0..2..1..2....0..0..1..0..3....0..0..2..2..1....0..0..1..3..3