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.

A184559 Number of (n+1)X5 0..2 arrays with no 2X2 subblock summing to less than 4.

Original entry on oeis.org

14180, 1486258, 134840527, 12900566348, 1214657950233, 115000791536877, 10868641315040295, 1027803541995894568, 97176104485641628222, 9188347231740579769607, 868772129294612664475944
Offset: 1

Views

Author

R. H. Hardin Jan 17 2011

Keywords

Comments

Column 4 of A184564

Examples

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