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.

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

Original entry on oeis.org

81, 7074, 2046098, 2171002788, 7861640359954
Offset: 1

Views

Author

R. H. Hardin Feb 03 2011

Keywords

Comments

Diagonal of A185777

Examples

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