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.

A185774 Number of (n+1)X5 0..2 arrays with no 2X2 subblock sum equal to any horizontal or vertical neighbor 2X2 subblock sum.

Original entry on oeis.org

26784, 1151346, 48744342, 2171002788, 95851024672, 4212755548948, 184696487434352, 8130440303768416, 357605861336206826, 15723990359863559644, 691174683753522142476, 30395002285452611004698
Offset: 1

Views

Author

R. H. Hardin Feb 03 2011

Keywords

Comments

Column 4 of A185777

Examples

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