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.

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

Original entry on oeis.org

216912, 88458672, 30765364899, 11348244616180, 4110692224930359, 1498459859767029015, 545098899148923125052, 198432026871542606565562, 72218093862175663215790336, 26285411777044349448747311771
Offset: 1

Views

Author

R. H. Hardin Jan 19 2011

Keywords

Comments

Column 4 of A184673

Examples

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