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.

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

Original entry on oeis.org

26784, 443362, 7252320, 135741428, 2461955138, 44789509812, 808045500430, 14674315377606, 265844130932752, 4822273171428216, 87389675007459160, 1584487801002237370, 28722425603939593796, 520728445103764345118
Offset: 1

Views

Author

R. H. Hardin, Dec 28 2014

Keywords

Comments

Column 4 of A253164

Examples

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