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.

A253292 Number of (n+1)X(4+1) 0..2 arrays with every 2X2 subblock sum differing from its neighbors horizontally, vertically, diagonally and antidiagonally.

Original entry on oeis.org

26784, 167832, 1029888, 8153960, 61286116, 465921688, 3524494796, 26879615668, 204459584768, 1560668372324, 11882769388376, 90517446353584, 689680753666852, 5257319067276484, 40057456786744360, 305206750112569024
Offset: 1

Views

Author

R. H. Hardin, Dec 29 2014

Keywords

Comments

Column 4 of A253294

Examples

			Some solutions for n=2
..1..0..0..0..0....0..2..2..2..2....1..2..0..0..1....0..1..2..2..2
..0..0..0..2..2....0..2..2..1..1....2..1..0..1..1....1..1..2..2..0
..1..2..2..1..1....1..0..2..0..2....2..2..1..0..2....2..1..0..1..0